Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals

Abstract

We study chains of lattice ideals that are invariant under a symmetric group action. In our setting, the ambient rings for these ideals are polynomial rings which are increasing in (Krull) dimension. Thus, these chains will fail to stabilize in the traditional commutative algebra sense. However, we prove a theorem which says that "up to the action of the group", these chains locally stabilize. We also give an algorithm, which we have implemented in software, for explicitly constructing these stabilization generators for a family of Laurent toric ideals involved in applications to algebraic statistics. We close with several open problems and conjectures arising from our theoretical and computational investigations.

to appear in the Journal of Symbolic Computation

References in corpus (6)

• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Viterbi Sequences and Polytopes
• Markov chain Monte Carlo test of toric homogeneous Markov chains
• On the decomposable semigroups and applications
• Degree Bounds for a Minimal Markov Basis for the Three-State Toric Homogeneous Markov Chain Model
• Secant Varieties of Segre--Veronese Varieties