Back to Search
Start Over
Efficient Gröbner bases computation over principal ideal rings.
- Source :
-
Journal of Symbolic Computation . Mar2021, Vol. 103, p1-13. 13p. - Publication Year :
- 2021
-
Abstract
- In this paper we present new techniques for improving the computation of strong Gröbner bases over a principal ideal ring R. More precisely, we describe how to lift a strong Gröbner basis along a canonical projection R → R / n , n ≠ 0 , and along a ring isomorphism R → R 1 × R 2. We then apply this to the computation of strong Gröbner bases over a non-trivial quotient of a principal ideal domain R / n R. The idea is to run a standard Gröbner basis algorithm pretending R / n R to be field. If we discover a non-invertible leading coefficient c , we use this information to try to split n = a b with coprime a , b. If this is possible, we recursively reduce the original computation to two strong Gröbner bases computations over R / a R and R / b R respectively. If no such c is discovered, the returned Gröbner basis is already a strong Gröbner basis for the input ideal over R / n R. [ABSTRACT FROM AUTHOR]
- Subjects :
- *GROBNER bases
*ALGORITHMS
*IDEALS (Algebra)
Subjects
Details
- Language :
- English
- ISSN :
- 07477171
- Volume :
- 103
- Database :
- Academic Search Index
- Journal :
- Journal of Symbolic Computation
- Publication Type :
- Academic Journal
- Accession number :
- 146120482
- Full Text :
- https://doi.org/10.1016/j.jsc.2019.10.020