Corrigendum to: ``Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals

DOI10.1016/j.jsc.2015.09.002zbMath1330.13045OpenAlexW2218666365MaRDI QIDQ898290

Christopher J. Hillar, Abraham Martín del Campo

Publication date: 8 December 2015

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

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

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

• 4ti2
• symmChainGens
• FourTiTwo

Cites Work

• Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
• The theory of well-quasi-ordering: a frequently discovered concept
• Equivariant lattice generators and Markov bases
• Finite generation of symmetric ideals
• What can be computed in algebraic geometry?

This page was built for publication: Corrigendum to: ``Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals