arXiv · 0801.4439
An Algorithm for Finding Symmetric Gröbner Bases in Infinite Dimensional Rings
Abstract
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gröbner bases for symmetric ideals in the infinite dimensional polynomial ring $R$. This allows for symbolic computation in a new class of rings. In particular, we solve the ideal membership problem for symmetric ideals of $R$.
Explore related subjects
Keep this discovery
Matthias Aschenbrenner, Christopher J. Hillar. 2008-01-29. An Algorithm for Finding Symmetric Gröbner Bases in Infinite Dimensional Rings. https://arxiv.org/abs/0801.4439
Cite the original work for its findings. Save a collection to share your selection of sources.