Details:
| Title | An algorithm for finding symmetric Grobner bases in infinite dimensional rings | | Author(s) | Matthias Aschenbrenner, Christopher Hillar | | Type | Article in Conference Proceedings | | Abstract | A symmetric ideal I ⊂ R = K[x1,x2,...] is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Grobner 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. | | Keywords | Grobner basis, algorithm, invariant ideal, partial ordering, polynomial reduction, symmetric group | | Length | 8 | | ISBN | 978-1-59593-904-3 |
| URL |
http://doi.acm.org/10.1145/1390768.1390787 |
| Language | English | | Pages | 117--124 | | Publisher | ACM | | Address | New York, NY, USA | | Year | 2010 | | Translation |
No | | Refereed |
Yes | | Conferencename | ISSAC '08, the twenty-first international symposium on Symbolic and algebraic computation |
|
