Computing the \textbf{V}-saturation of finitely-generated submodules of \(\mathbf{V} [X]^m\) where \textbf{V} is a valuation domain

DOI10.1016/j.jsc.2015.02.006zbMath1327.13073OpenAlexW2031459264MaRDI QIDQ492033

Ihsen Yengui, Lionel Ducos, Samiha Monceur

Publication date: 19 August 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2015.02.006

zbMATH Keywords

coherencesyzygiessaturationvaluation domainsPrüfer domainsechelon matrix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13P99) Syzygies, resolutions, complexes and commutative rings (13D02) Valuation rings (13F30) Dedekind, Prüfer, Krull and Mori rings and their generalizations (13F05)

Related Items (2)

Computing syzygies over \(V [X_1, \ldots, X_k\), \(V\) a valuation domain] ⋮ Saturation of finitely-generated submodules of free modules over Prüfer domains

Cites Work

• The Gröbner ring conjecture in one variable
• On the leading terms ideals of polynomial ideals over a valuation ring
• 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.)
• 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]
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the \textbf{V}-saturation of finitely-generated submodules of \(\mathbf{V} [X]^m\) where \textbf{V} is a valuation domain