Continuously Parameterized Symmetries and Buchberger’s Algorithm
Systems of polynomial equations often have symmetries. In solving such a system using Buchberger’s algorithm, the symmetries are neglected. Incorporating symmetries into the solution process enables us to solve larger problems than with Buchberger’s algorithm alone. This paper presents a method that...
Saved in:
| Published in | Journal of symbolic computation Vol. 33; no. 1; pp. 43 - 55 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Ltd
01.01.2002
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | Systems of polynomial equations often have symmetries. In solving such a system using Buchberger’s algorithm, the symmetries are neglected. Incorporating symmetries into the solution process enables us to solve larger problems than with Buchberger’s algorithm alone. This paper presents a method that shows how this can be achieved and also gives an algorithm that brings together continuously parameterized symmetries with Buchberger’s algorithm. |
|---|---|
| ISSN: | 0747-7171 1095-855X |
| DOI: | 10.1006/jsco.2001.0478 |