An algorithm for checking whether a simplicial toric ideal is a complete intersection

DOI10.1145/1940475.1940481zbMath1305.68345OpenAlexW1977753184MaRDI QIDQ5175239

Ignacio García-Marco, Isabel Bermejo

Publication date: 20 February 2015

Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1940475.1940481

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Linkage, complete intersections and determinantal ideals (13C40) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

This page was built for publication: An algorithm for checking whether a simplicial toric ideal is a complete intersection