Prolongations and computational algebra
Jessica Sidman, Seth Sullivant
Abstract
We 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.
Create a lesson
Related papers
On the Stable category of maximal Cohen-Macaulay modules over Gorenstein rings-II
Tony J. Puthenpurakal
Symbolic powers of the ideal ofn general points in Pn-1
Ralf Fröberg, Boris Shapiro
Density functions for filtrations of graded ideals
Suprajo Das, Hoang Le Truong
Finitistic injective dimension exceeding finitistic projective dimension for a commutative ring
Liang Chen
A criterion for determinantal presentations of numerical semigroup rings
Satoshi Murai, Kou Takahashi
Normality of ideals beyond the standard graded setting: families from numerical semigroup rings
Naoyuki Matsuoka