Computing Gröbner Fans of Toric Ideals (Q4526075)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1553179
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Gröbner Fans of Toric Ideals |
scientific article; zbMATH DE number 1553179 |
Statements
Computing Gröbner Fans of Toric Ideals (English)
0 references
1 May 2001
0 references
state polytope
0 references
Gröbner walk
0 references
tigers
0 references
efficient algorithms
0 references
toric ideal
0 references
0 references
0.8925732374191284
0 references
0.845759391784668
0 references
0.8422215580940247
0 references
In the theory of Gröbner bases it is well-known that the reduced Gröbner bases of a homogeneous ideal correspond to the vertices of a polytope, the so-called state polytope. Term orders are identified if the associated reduced Gröbner basis is the same. The cones of equivalent term orders form a fan which is the normal fan of the state polytope. The authors present an algorithm for the computation of all vertices of the state polytope in case the ideal is a toric ideal. In this case the local changes in the Gröbner walk become purely combinatorial. The major improvement of the Gröbner walk for a toric ideal is analogous to the reverse enumeration of vertices of a polytope by Avis and Fukuda. The authors show that all reduced Gröbner bases of a toric ideal may be ordered in an acyclic directed graph. Implementation details and examples as well as web address for the developed software are given. This nice paper will be interesting not only for people working in computational algebraic geometry, but for everybody working on efficient algorithms.
0 references