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

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

2011-10-04

arxiv.org/abs/1110.0785v2

Mathematics

Commutative Algebra

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-270065