An algorithm for unimodular completion over Laurent polynomial rings

DOI10.1016/J.LAA.2008.05.002MaRDI QIDQ947632zbMATH OpenOpenAlexFDO

Authors Morou Amidou, Ihsen Yengui

Publication date 6 October 2008

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2008.05.002

zbMATH Keywords

computer algebradoubly monic Laurent polynomialsmultivariate Laurent polynomial matricesQuillen-Suslin theoremunimodular vector

Mathematics Subject Classification ID

Other constructive mathematics (03F65) Projective and free modules and ideals in commutative rings (13C10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Stability for projective modules (19A13)

Review text

Let \(K\) be an infinite field, \(R=K[X_1^{\pm 1}, \ldots, X_s^{\pm 1}]\) a multivariate Laurent polynomial ring, and a vector \(v\in R^n\) whose entries generate the unit ideal in \(R\). The paper contains an efficient algorithm which constructs an invertible \(n\times n\) matrix \(M\) over \(K[X_1, \ldots, X_s]\), whose determinant is a monomial, such that \(Mv={}^t (1,0, \ldots, 0)\). The correctness is ensured by a generalization of Suslin's Lemma to Laurent polynomials. The sequential complexity of the algorithm is \(n^4d^{O(s^2)}\) field operations, where \(d\) is the maximum degree of the entries of \(v\), and is due to a clever change of variables which generates doubly monic Laurent polynomials without the exponential explosion of degrees encountered when working à la Nagata. The efficiency is improved by manipulating directly Laurent polynomials, without passing to ordinary polynomial ring as did \textit{H. Park} [J. Symb. Comput. 37, 209--226 (2004; Zbl 1047.94506)], and, unlike \textit{H. Park} and \textit{C. Woodburn} [J. Algebra 178, 277--298 (1995; Zbl 0841.19001)], eliminating all the variables at once.

Recommendations

• Unimodular completion of polynomial matrices
• Algorithmic aspects of Suslin's proof of Serre's conjecture
• Constructions in \(R[x_1,\dots ,x_n]\): applications to K-theory
• An algorithm for unimodular completion over noetherian rings
• Suslin's algorithms for reduction of unimodular rows

Cites work

• A generalization of Serre's conjecture and some related issues
• An algorithmic proof of Suslin's stability theorem for polynomial rings
• Controllability and observability of linear delay systems: an algebraic approach
• Faisceaux algébriques cohérents
• Gröbner bases and multidimensional FIR multirate systems
• scientific article; zbMATH DE number 3550852 (Why is no real title available?)
• scientific article; zbMATH DE number 2166983 (Why is no real title available?)
• scientific article; zbMATH DE number 2084947 (Why is no real title available?)
• On syzygy modules for polynomial matrices
• ON THE STRUCTURE OF THE SPECIAL LINEAR GROUP OVER POLYNOMIAL RINGS
• Polynomial matrices with given determinant
• Projective modules over polynomial rings
• Serre's conjecture
• Suslin's algorithms for reduction of unimodular rows
• Symbolic computation and signal processing
• The Quillen - Suslin theorem and the structure of n-dimensional elementary polynomial matrices

Cited in

(8)

• Generic pole assignability, structurally constrained controllers and unimodular completion
• An algorithm for unimodular completion over noetherian rings
• Making the use of maximal ideals constructive
• Unimodular completion of polynomial matrices
• An algorithm for doubly unitary Laurent polynomials
• Unimodular rows over Laurent polynomial rings
• On the realizability of the special linear group over the multivariate Laurent polynomial ring
• On syzygy modules over Laurent polynomial rings

This page was built for publication: An algorithm for unimodular completion over Laurent polynomial rings

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