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

DOI10.1016/J.JSC.2015.02.006MaRDI QIDQ492033zbMATH OpenOpenAlexFDO

Authors Lionel Ducos, Samiha Monceur, Ihsen Yengui

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

coherencesaturationsyzygiesvaluation domainsechelon matrixPrüfer domains

Mathematics Subject Classification ID

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

Recommendations

• Un Algorithme pour le Calcul des Syzygies surV[X] dans le cas oùVest un Domaine de Valuation
• Computing syzygies over \(V [X_1, \ldots, X_k]\), \(V\) a valuation domain
• Gröbner bases for ideals in univariate polynomial rings over valuation rings
• Saturation of finitely-generated submodules of free modules over Prüfer domains
• A Gröbner basis algorithm for ideals over zero-dimensional valuation rings

Cites work

• scientific article; zbMATH DE number 638938 (Why is no real title available?)
• scientific article; zbMATH DE number 2084947 (Why is no real title available?)
• 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.)
• Commutative algebra. Constructive methods. Finite type projective modules. Course and exercises
• Dynamical Gröbner bases
• Dynamical Gröbner bases over Dedekind rings
• On the leading terms ideals of polynomial ideals over a valuation ring
• The Gröbner ring conjecture in one variable
• 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

Cited in

(2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492033)