Presents a lifting technique to compute strong Gröbner bases over R/nR by reducing computations over R/nR to those over R/aR and R/bR for coprime a and b, recursing to fields for squarefree n via non-invertible coefficient detection.
Effective computation of strong Gröbner bases over Euclidean domains
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Efficient Gr\"obner Bases Computation over Principal Ideal Rings
Presents a lifting technique to compute strong Gröbner bases over R/nR by reducing computations over R/nR to those over R/aR and R/bR for coprime a and b, recursing to fields for squarefree n via non-invertible coefficient detection.