Efficient Gröbner bases computation over principal ideal rings
From MaRDI portal
Publication:2211184
DOI10.1016/j.jsc.2019.10.020zbMath1451.13078arXiv1906.08543OpenAlexW2988075093MaRDI QIDQ2211184
Publication date: 13 November 2020
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.08543
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Effective computation of strong Gröbner bases over Euclidean domains
- An algorithm for computing a Gröbner basis of a polynomial ideal over a ring with zero divisors
- On the construction of Gröbner bases using syzygies
- The theory of Gröbner bases
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- On lucky ideals for Gröbner basis computations
- Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- The Magma algebra system. I: The user language
- Modular algorithms for computing Gröbner bases.
- Resolution of singularities of an algebraic variety over a field of characteristic zero. II
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Gröbner bases with coefficients in rings
- Über die Deformation isolierter Singularitäten analytischer Mengen
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- Strong Gröbner bases for polynomials over a principal ideal ring
- APPLYING BUCHBERGER'S CRITERIA FOR COMPUTING GRÖBNER BASES OVER FINITE-CHAIN RINGS
- Computing in quotients of rings of integers
- Factor Refinement
- On Signature-Based Gröbner Bases Over Euclidean Rings
- Nemo/Hecke
