Equivariant Gröbner bases

From MaRDI portal
Publication:4627686

zbMATH Open1411.13029arXiv1610.02075MaRDI QIDQ4627686FDOQ4627686


Authors: Christopher J. Hillar, Robert Krone, Anton Leykin Edit this on Wikidata


Publication date: 11 March 2019

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.


Full work available at URL: https://arxiv.org/abs/1610.02075




Recommendations





Cited In (13)

Uses Software





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)