Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\)

DOI10.1016/j.jsc.2011.12.046zbMath1245.13019OpenAlexW2094542436MaRDI QIDQ432760

Alessandro Logar, Giandomenico Boffi

Publication date: 4 July 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.046

zbMATH Keywords

Gröbner basisbinomial idealpolyhedral coneHilbert basis

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (1)

Border bases for lattice ideals

Uses Software

• CoCoA
• Normaliz
• 4ti2

Cites Work

• Unnamed Item
• Unnamed Item
• Computing generating sets of lattice ideals and Markov bases of lattices
• A note on the problem of reporting maximal cliques
• Gröbner bases of lattices, corner polyhedra, and integer programming
• Binomial ideals
• Polytopes, Rings, and K-Theory
• A Geometric Buchberger Algorithm for Integer Programming

This page was built for publication: Computing Gröbner bases of pure binomial ideals via submodules of \(\mathbb Z^n\)