An algorithm for unimodular completion over Laurent polynomial rings

DOI10.1016/j.laa.2008.05.002zbMath1147.13004OpenAlexW2013195647MaRDI QIDQ947632

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

Quillen-Suslin theoremcomputer algebradoubly monic Laurent polynomialsmultivariate Laurent polynomial matricesunimodular vector

Mathematics Subject Classification ID

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

Related Items (5)

Generic pole assignability, structurally constrained controllers and unimodular completion ⋮ Unnamed Item ⋮ Making the use of maximal ideals constructive ⋮ On syzygy modules over Laurent polynomial rings ⋮ Unimodular rows over Laurent polynomial rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic computation and signal processing
• Gröbner bases and multidimensional FIR multirate systems
• Faisceaux algébriques cohérents
• Serre's conjecture
• An algorithmic proof of Suslin's stability theorem for polynomial rings
• Suslin's algorithms for reduction of unimodular rows
• Polynomial matrices with given determinant
• The Quillen - Suslin theorem and the structure of n-dimensional elementary polynomial matrices
• ON THE STRUCTURE OF THE SPECIAL LINEAR GROUP OVER POLYNOMIAL RINGS
• Controllability and observability of linear delay systems: an algebraic approach
• Projective modules over polynomial rings
• On syzygy modules for polynomial matrices
• A generalization of Serre's conjecture and some related issues

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