Equivariant Gröbner bases and the Gaussian two-factor model

@article{Brouwer2009EquivariantGB,
  title={Equivariant Gr{\"o}bner bases and the Gaussian two-factor model},
  author={Andries E. Brouwer and Jan Draisma},
  journal={Math. Comput.},
  year={2009},
  volume={80},
  pages={1123-1133}
}
Exploiting symmetry in Grobner basis computations is difficult when the symmetry takes the form of a group acting by automorphisms on monomials in finitely many variables. This is largely due to the fact that the group elements, being invertible, cannot preserve a term order. By contrast, inspired by work of Aschenbrenner and Hillar, we introduce the concept of equivariant Grobner basis in a setting where a monoid acts by homomorphisms on monomials in potentially infinitely many variables. We… 

Tables from this paper

ALGORITHMS FOR EQUIVARIANT GRÖBNER BASES

A polynomial ring over a countably infinite number of variables presents some obstacles to computation because it is not Noetherian. However, often ideals of interest in this setting are endowed with

Noetherianity for infinite-dimensional toric varieties

We consider a large class of monomial maps respecting an action of the infinite symmetric group, and prove that the toric ideals arising as their kernels are finitely generated up to symmetry. Our

Gröbner bases and gradings for partial difference ideals

A working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients for difference ideals, and generalizes also the concepts of homogenization and saturation, and related algorithms, to the context of difference ideals.

Extended letterplace correspondence for nongraded noncommutative ideals and related algorithms

The notion of saturation for the graded ideals of K〈xi,t〉, where t is an extra variable and for their letterplace analogues in the commutative polynomial algebra K[xij, tj], where j ranges in ℕ.

Equivariant Gröbner Bases of Symmetric Toric Ideals

An algorithm is presented for computing equivariant Gröbner bases that terminates whenever a finite basis exists, improving on previous algorithms that only guaranteed termination in rings Noetherian up to symmetry.

Equivariant Gröbner bases

The current state of theory and applications for equivariant Gröbner bases are summarized, several algorithms to compute them are developed, and several open problems and computational challenges are closed.

Finiteness theorems for invariant chains of lattice ideals

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.

References

SHOWING 1-10 OF 16 REFERENCES

Finite generation of symmetric ideals

Let be a commutative Noetherian ring, and let be the polynomial ring in an infinite collection of indeterminates over . Let be the group of permutations of . The group acts on in a natural way, and

An algorithm for finding symmetric Grobner bases in infinite dimensional rings

An explicit algorithm is given to find Grobner bases for symmetric ideals in the infinite dimensional polynomial ring R, which allows for symbolic computation in a new class of rings.

Gröbner bases and triangulations of the second hypersimplex

A quadratic Gröbner basis is presented for the associated toric idealK(Kn) and a non-regular triangulation of Δ(2,n) forn≥9 is constructed.

A Groebner basis for the secant ideal of the second hypersimplex

We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires

Combinatorial secant varieties

The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are

SINGULAR: a computer algebra system for polynomial computations

SINGULAR is a specialized computer algebra system for polynomial computations with emphasize on the needs of commutative algebra, algebraic geometry, and singularity theory, which features one of the fastest and most general implementations of various algorithms for computing standard resp.