Prolongations and computational algebra

Simple item page
dc.creatorSidman, Jessica
dc.creatorSullivant, Seth
dc.date2006-11-22
dc.date2008-04-03
dc.date.accessioned2026-07-07T09:29:57Z
dc.date.available2026-07-07T09:29:57Z
dc.descriptionWe explore the geometric notion of prolongations in the setting of computational algebra, extending results of Landsberg and Manivel which relate prolongations to equations for secant varieties. We also develop methods for computing prolongations which are combinatorial in nature. As an application, we use prolongations to derive a new family of secant equations for the binary symmetric model in phylogenetics.
dc.description19 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0611696
dc.identifierhttp://arxiv.org/abs/math/0611696
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/157975
dc.subjectCommutative Algebra
dc.subjectAlgebraic Geometry
dc.titleProlongations and computational algebra
dc.typetext

Files

Collections

arXiv