Prolongations and Computational Algebra
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 3920595
- scientific article; zbMATH DE number 1522643
- scientific article; zbMATH DE number 3848613
- scientific article; zbMATH DE number 4110093
- scientific article; zbMATH DE number 1751719
- Computation algebras
- Computational methods in algebra and analysis
- Computer algebra and algebraic analysis
Cited in
(15)- On the containment problem
- Plücker varieties and higher secants of Sato's Grassmannian
- A matryoshka structure of higher secant varieties and the generalized Bronowski's conjecture
- Combinatorial symbolic powers
- Equations and syzygies of the first secant variety to a smooth curve
- An algebraic approach to computations with progress
- Geometry and the complexity of matrix multiplication
- scientific article; zbMATH DE number 177876 (Why is no real title available?)
- Initial sequences and Waldschmidt constants of planar point configurations
- Equations for secant varieties of Chow varieties
- Toward a salmon conjecture
- Comparison of symbolic and ordinary powers of parity binomial edge ideals
- Linear preservers of secant varieties and other varieties of tensors
- A Gröbner basis for the secant ideal of the second hypersimplex
- Decomposing tensors into frames
This page was built for publication: Prolongations and Computational Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322982)
