Back to Search
Start Over
Sagbi combinatorics of maximal minors and a Sagbi algorithm.
- Source :
-
Journal of Symbolic Computation . Jan2024, Vol. 120, pN.PAG-N.PAG. 1p. - Publication Year :
- 2024
-
Abstract
- The maximal minors of a matrix of indeterminates are a universal Gröbner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental approach we discuss their behavior under varying monomial orders and their extensions to Sagbi bases. These experiments motivated a new implementation of the Sagbi algorithm which is organized in a Singular script and falls back on Normaliz for the combinatorial computations. In comparison to packages in the current standard distributions of Macaulay 2, version 1.21, and Singular, version 4.2.1 and a package intended for CoCoA 5.4.2, it extends the range of computability by at least one order of magnitude. [ABSTRACT FROM AUTHOR]
- Subjects :
- *MINORS
*CURRENT distribution
*ALGORITHMS
*GROBNER bases
Subjects
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 120
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 164964878
- Full Text :
- https://doi.org/10.1016/j.jsc.2023.102237