Dynamical Gröbner bases
From MaRDI portal
Publication:855700
DOI10.1016/j.jalgebra.2006.01.051zbMath1113.13013OpenAlexW2081582540MaRDI QIDQ855700
Publication date: 7 December 2006
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2006.01.051
Related Items
A Gröbner basis algorithm for ideals over zero-dimensional valuation rings ⋮ The Gröbner ring conjecture in the lexicographic order case ⋮ COMPUTING SYZYGIES OVER R[X_{1}^{\pm 1},...,X_{n}^{\pm 1}, R A VALUATION RING] ⋮ Noether normalization theorem and dynamical Gröbner bases over Bézout domains of Krull dimension 1 ⋮ A negative answer to a question about leading terms ideals of polynomial ideals ⋮ GRÖBNER-SHIRSHOV BASIS FOR MONOMIALS SEMIRING OVER D-A RINGS ⋮ The Gröbner ring conjecture in one variable ⋮ Some improvements for the algorithm of Gröbner bases over dual valuation domain ⋮ On the leading terms ideals of polynomial ideals over a valuation ring ⋮ Intersection of ideals in a polynomial ring over a dual valuation domain ⋮ Semi-ring Based Gröbner–Shirshov Bases over a Noetherian Valuation Ring ⋮ On the Computation of Minimal Free Resolutions with Integer Coefficients ⋮ Corrigendum to ``Dynamical Gröbner bases and to ``Dynamical Gröbner bases over Dedekind rings ⋮ Computing the \textbf{V}-saturation of finitely-generated submodules of \(\mathbf{V} [X^m\) where \textbf{V} is a valuation domain] ⋮ A constructive comparison of the rings \(R(X)\) and \(R\langle X\rangle\) and application to the Lequain-Simis induction theorem ⋮ Making the use of maximal ideals constructive ⋮ Computing syzygies over \(V [X_1, \ldots, X_k\), \(V\) a valuation domain] ⋮ Hidden constructions in abstract algebra. VI: The theorem of Maroscia and Brewer {\&} Costa ⋮ Noncommutative Gröbner Basis over a Divisible and Annihilable Ring ⋮ Constructing Gröbner bases for Noetherian rings ⋮ Dynamical Gröbner bases over Dedekind rings ⋮ The syzygy theorem for Bézout rings ⋮ A counterexample to the Gröbner ring conjecture ⋮ On syzygy modules over Laurent polynomial rings ⋮ Noncommutative Gröbner Bases over Rings ⋮ Saturation of finitely-generated submodules of free modules over Prüfer domains ⋮ Un Algorithme pour le Calcul des Syzygies surV[X dans le cas oùVest un Domaine de Valuation] ⋮ A zero-dimensional valuation ring is 1-Gröbner
Cites Work
- On constructing bases for ideals in polynomial rings over the integers
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain
- A course in constructive algebra
- A solution to Kronecker's problem
- On the structure of linear and cyclic codes over a finite chain ring
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Algorithmic theory of arithmetic rings, Prüfer rings and Dedekind rings. (Théorie algorithmique des anneaux arithmétiques, des anneaux de Prüfer et des anneaux de Dedekind.)
- Strong Gröbner bases for polynomials over a principal ideal ring
- Sketches and computation – II: dynamic evaluation and applications
- Ideal membership in polynomial rings over the integers
- Gröbner bases and products of coefficient rings
- Gröbner bases over Galois rings with an application to decoding alternant codes
- Dynamical method in algebra: Effective Nullstellensätze
- Unnamed Item
- Unnamed Item
