Equivariant Gröbner bases
From MaRDI portal
Publication:4627686
Abstract: Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible the development of effective routines. Ability to compute relies on finite generation up to symmetry for ideals invariant under a large group or monoid action, such as the permutations of the natural numbers. We summarize the current state of theory and applications for equivariant Gr"obner bases, develop several algorithms to compute them, showcase our software implementation, and close with several open problems and computational challenges.
Recommendations
Cited in
(13)- Equivariant Gröbner bases and the Gaussian two-factor model
- A Gröbner basis criterion for birational equivalence of affine varieties
- Noetherianity and Specht problem for varieties of bicommutative algebras
- Finite numbers of initial ideals in non-Noetherian polynomial rings
- Theorems of Carathéodory, Minkowski–Weyl, and Gordan up to Symmetry
- Symideal Gröbner bases
- Gröbner bases, invariant theory and equivariant dynamics
- Rationality of equivariant Hilbert series and asymptotic properties
- Computing Gröbner bases and free resolutions of OI-modules
- Implicitisation and parameterisation in polynomial functors
- Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals
- Normalization of indexed differentials by extending Gröbner basis theory
- Equivariant Gröbner Bases of Symmetric Toric Ideals
This page was built for publication: Equivariant Gröbner bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4627686)