GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS

DOI10.1142/S1793830910000462zbMath1193.13031MaRDI QIDQ3560060

Deepanjan Kesh, Shashank K. Mehta

Publication date: 19 May 2010

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

Groebner basistoric idealsBuchberger algorithmideal saturation

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Uses Software

• GRIN

Cites Work

• Computing generating sets of lattice ideals and Markov bases of lattices
• A theorem on refining division orders by the reverse lexicographic order
• On the complexity of computing syzygies
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• A Variant of the Buchberger Algorithm for Integer Programming
• A Geometric Buchberger Algorithm for Integer Programming
• An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms

This page was built for publication: GENERALIZED REDUCTION TO COMPUTE TORIC IDEALS