Suslin's algorithms for reduction of unimodular rows

DOI10.1016/J.JSC.2005.01.004zbMATH Open1120.13034OpenAlexW1980974501MaRDI QIDQ2456568FDOQ2456568

Authors: Ihsen Yengui, Henri Lombardi 

Publication date: 19 October 2007

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

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

Recommendations

• Suslin's lemma for rings containing an infinite field
• Algorithmic aspects of Suslin's proof of Serre's conjecture
• Algorithms for the Quillen-Suslin theorem
• An algorithm for unimodular completion over noetherian rings
• Constructions in \(R[x_1,\dots ,x_n]\): applications to K-theory

zbMATH Keywords

computer algebraconstructive mathematicsQuillen-Suslin theoremSuslin's stability theorem

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Other constructive mathematics (03F65) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Stability for projective modules (19A13)

Cites Work

• ON THE STRUCTURE OF THE SPECIAL LINEAR GROUP OVER POLYNOMIAL RINGS
• Algorithms for the Quillen-Suslin theorem
• An algorithmic proof of Suslin's stability theorem for polynomial rings
• Serre's conjecture
• Making the use of maximal ideals constructive
• Title not available (Why is that?)
• Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel
• Algorithmic aspects of Suslin's proof of Serre's conjecture

Cited In (14)

• A Note on The Row-Reduction Algorithm
• Recent progress in an algebraic analysis approach to linear systems
• Unimodular rows over Laurent polynomial rings
• A constructive comparison of the rings \(R(X)\) and \(R\langle X\rangle\) and application to the Lequain-Simis induction theorem
• An algorithm for unimodular completion over noetherian rings
• Quillen-Suslin theory revisited
• An Elementary Transformation of a Special Unimodular Vector to Its Top Coefficient Vector
• Suslin matrices and the Euler characteristic
• Spectral schemes as ringed lattices
• Making the use of maximal ideals constructive
• An algorithm for unimodular completion over Laurent polynomial rings
• Matrix description of Suslin's theorem
• On a theorem of Suslin
• Bounding the degrees of a minimal \(\mu\)-basis for a rational surface parametrization

This page was built for publication: Suslin's algorithms for reduction of unimodular rows

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