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

DOI10.1016/J.JSC.2015.09.002zbMATH Open1330.13045OpenAlexW2218666365MaRDI QIDQ898290FDOQ898290

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)

Cites Work

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

Cited In (4)

• Corrigendum to ``A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families, by Joseph Y.- T. Leung and W.-D. Wei
• Corrigendum: Decompositions of cellular binomial ideals
• On the Existence Problem of Finite Bases of Identities in the Algebras of Recursive Functions
• CORRIGENDUM TO: A FAST ALGORITHM FOR CALCULATING S-INVARIANTS

Uses Software

• 4ti2
• symmChainGens
• FourTiTwo

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

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