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

DOI10.1145/1940475.1940481zbMATH Open1305.68345OpenAlexW1977753184MaRDI QIDQ5175239FDOQ5175239

Authors: Isabel Bermejo, Ignacio García Marco 

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) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linkage, complete intersections and determinantal ideals (13C40)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175239)