Corrigendum to: ``Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
DOI10.1016/J.JSC.2015.09.002zbMATH Open1330.13045OpenAlexW2218666365MaRDI QIDQ898290FDOQ898290
Authors: 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
Recommendations
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- Erratum to ``Bertini irreducibility theorems over finite fields
- Corrigendum to: ``\(l\)-LIPs of codes over finite chain rings
- TEST IDEALS IN RINGS WITH FINITELY GENERATED ANTI-CANONICAL ALGEBRAS – CORRIGENDUM
- Correction to: ``Some singular curves and surfaces arising from invariants of complex reflection groups
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
Cited In (8)
- 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
- Corrigendum to: ``Invariant theory and scaling algorithms for maximum likelihood estimation
- Corrigenda and addenda to: ``Rigidity for MPR, the Malvenuto-Poirier-Reutenauer Hopf algebra of permutations.
- Correction to: ``Distance between vertices of lattice polytopes
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice 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
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)