Abstract
We introduce a new algorithm for computing comprehensive Groebner systems. There exists the Suzuki-Sato algorithm for computing comprehensive Groebner systems. The Suzuki-Sato algorithm often creates overmuch cells of the parameter space for comprehensive Groebner systems. Therefore the computation becomes heavy. However, by using inequations (``not equal zero''), we can obtain different cells. In many cases, this number of cells of parameter space is smaller than that of Suzuki-Sato's. Therefore, our new algorithm is more efficient than Suzuki-Sato's one, and outputs a nice comprehensive Groebner system. Our new algorithm has been implemented in the computer algebra system Risa/Asir. We compare the runtime of our implementation with the Suzuki-Sato algorithm and find our algorithm superior in many cases.
| Original language | English |
|---|---|
| Title of host publication | ISSAC 2007 |
| Editors | C. W. Brown |
| Publisher | ACM Press |
| Pages | 299-306 |
| Number of pages | 8 |
| ISBN (Print) | 978-1-59593-743-8 |
| Publication status | Published - 2007 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver