Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
From MaRDI portal
Publication:1930175
DOI10.1016/j.jsc.2012.06.006zbMath1263.13031arXiv1110.0785OpenAlexW2063765066MaRDI QIDQ1930175
Abraham Martín del Campo, Christopher J. Hillar
Publication date: 10 January 2013
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.0785
finitenesssymmetric groupinvariant idealstoric ideallattice idealpermutation modulechain stabilizationnice orderings
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (6)
Corrigendum to: ``Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals ⋮ GL-equivariant modules over polynomial rings in infinitely many variables ⋮ Symmetric polynomials and nonfinitely generated \(\mathrm{Sym}(\mathbb{N})\)-invariant ideals ⋮ A Kruskal-Katona type result and applications ⋮ Gröbner methods for representations of combinatorial categories ⋮ Gröbner bases and gradings for partial difference ideals
Uses Software
This page was built for publication: Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
