Computing syzygies over \(V [X_1, \ldots, X_k]\), \(V\) a valuation domain
From MaRDI portal
Publication:2254141
DOI10.1016/j.jalgebra.2014.11.018zbMath1308.13020MaRDI QIDQ2254141
Annick Valibouze, Ihsen Yengui, Lionel Ducos
Publication date: 4 February 2015
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.11.018
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
13D02: Syzygies, resolutions, complexes and commutative rings
13F30: Valuation rings
Related Items
COMPUTING SYZYGIES OVER R[X_{1}^{\pm 1},...,X_{n}^{\pm 1}, R A VALUATION RING], A counterexample to the Gröbner ring conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Gröbner ring conjecture in one variable
- On the leading terms ideals of polynomial ideals over a valuation ring
- Computing the \textbf{V}-saturation of finitely-generated submodules of \(\mathbf{V} [X^m\) where \textbf{V} is a valuation domain]
- Hilbert functions and the Buchberger algorithm
- Dynamical Gröbner bases
- Dynamical Gröbner bases over Dedekind rings
- A course in constructive algebra
- 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.)
- Critères de platitude et de projectivité. Techniques de platification d'un module. (Criterial of flatness and projectivity. Technics of flatification of a module.)
- The Gröbner ring conjecture in the lexicographic order case
- Un Algorithme pour le Calcul des Syzygies surV[X dans le cas oùVest un Domaine de Valuation]