An algorithm for unimodular completion over Laurent polynomial rings
From MaRDI portal
Publication:947632
DOI10.1016/j.laa.2008.05.002zbMath1147.13004MaRDI QIDQ947632
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
Quillen-Suslin theorem; computer algebra; doubly monic Laurent polynomials; multivariate Laurent polynomial matrices; unimodular vector
13C10: Projective and free modules and ideals in commutative rings
14Q20: Effectivity, complexity and computational aspects of algebraic geometry
03F65: Other constructive mathematics
19A13: Stability for projective modules
Related Items
On syzygy modules over Laurent polynomial rings, Generic pole assignability, structurally constrained controllers and unimodular completion, Making the use of maximal ideals constructive
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
