English

An Algorithm for Finding Symmetric Gr\"obner Bases in Infinite Dimensional Rings

Commutative Algebra 2008-01-30 v1 Combinatorics

Abstract

A \textit{symmetric ideal} IR=K[x1,x2,...]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\"obner bases for symmetric ideals in the infinite dimensional polynomial ring RR. This allows for symbolic computation in a new class of rings. In particular, we solve the ideal membership problem for symmetric ideals of RR.

Keywords

Cite

@article{arxiv.0801.4439,
  title  = {An Algorithm for Finding Symmetric Gr\"obner Bases in Infinite Dimensional Rings},
  author = {Matthias Aschenbrenner and Christopher J. Hillar},
  journal= {arXiv preprint arXiv:0801.4439},
  year   = {2008}
}

Comments

preliminary abstract, 10 pages

R2 v1 2026-06-21T10:07:26.213Z