Buchberger and Schreyer algorithms are generalized to strongly discrete coherent rings, with convergence characterized by finite generation of the leading term module.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.AC 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Generalised Buchberger and Schreyer algorithms for strongly discrete coherent rings
Buchberger and Schreyer algorithms are generalized to strongly discrete coherent rings, with convergence characterized by finite generation of the leading term module.