A Gröbner basis algorithm for ideals over zero-dimensional valuation rings

DOI10.1007/s11424-020-0010-3zbMath1483.13045OpenAlexW3120303595MaRDI QIDQ2121182

Dong-Mei Li, Jin-wang Liu

Publication date: 1 April 2022

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-020-0010-3

zbMATH Keywords

Gröbner basisvaluation ringGröbner ring conjecturenon-Noetherian ring

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Valuation rings (13F30)

Related Items (1)

Some improvements for the algorithm of Gröbner bases over dual valuation domain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The F5 algorithm in Buchberger's style
• The Gröbner ring conjecture in one variable
• On the leading terms ideals of polynomial ideals over a valuation ring
• On general factorizations for \(n\)-D polynomial matrices
• Dynamical Gröbner bases
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• On the structure of linear and cyclic codes over a finite chain ring
• On Lin-Bose problem
• Constructive commutative algebra. Projective modules over polynomial rings and dynamical Gröbner bases
• A zero-dimensional valuation ring is 1-Gröbner
• On the equivalence of multivariate polynomial matrices
• The Gröbner ring conjecture in the lexicographic order case
• Strong Gröbner bases for polynomials over a principal ideal ring
• Gröbner bases over Galois rings with an application to decoding alternant codes

This page was built for publication: A Gröbner basis algorithm for ideals over zero-dimensional valuation rings