An algorithm for finding symmetric Grobner bases in infinite dimensional rings

DOI10.1145/1390768.1390787MaRDI QIDQ5301612zbMATH OpenOpenAlexFDO

Authors Matthias Aschenbrenner, Christopher J. Hillar

Publication date 20 January 2009

Published in Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Abstract: A extit{symmetric ideal} $IsubseteqR=K[x_1,x_2,\mathrm{...}]$ 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 $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$.

Cited in

(2)

• Gröbner bases of symmetric ideals
• Equivariant ideals of polynomials

This page was built for publication: An algorithm for finding symmetric Grobner bases in infinite dimensional rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301612)