Suslin's algorithms for reduction of unimodular rows

Journal of Symbolic Computation

Volumn 39, Issue 6 SPEC. ISS., 2005, Pages 707-717

  Lombardi, Henri ^a   Yengui, Ihsen ^b  

^a UNIVERSITÉ DE FRANCHE COMTÉ   (France)

^b University of Sfax   (Tunisia)

Author keywords

Computer algebra; Constructive mathematics; Quillen Suslin theorem; Suslin's stability theorem

Indexed keywords

EID: 17344368857     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2005.01.004     Document Type: Article

References (9)

1. L. Caniglia G. Cortinas S. Danon J. Heintz T. Krick P. Solerno Algorithmic aspects of Suslin's proof of Serre's conjecture Comput. Complexity 3 1993 31-55
2. N. Fitchas A. Galligo Nullstellensatz effectif et conjecture de Serre (théorème de Quillen-Suslin) pour le calcul formel Math. Nachr. 149 1990 231-253
3. E. Kunz Introduction to Commutative Algebra and Algebraic Geometry 1991 Birkhäuser
4. T. Lam Serre's conjecture In: Lecture Notes in Mathematics vol. 635 1978 Springer-Verlag Berlin, New York
5. A. Logar B. Sturmfels Algorithms for the Quillen-Suslin Theorem. J. Algebra 145 1 1992 231-239
6. H. Lombardi C. Quitté Constructions cachées en algèbre abstraite (2) le principe local-global In: M. Fontana S.-E. Kabbaj S. Wiegand (Eds.) Commutative Ring Theory and Applications Lecture Notes in Pure and Applied Mathematics vol. 231 2003 M. Dekker 461-476
7. H. Park C. Woodburn An algorithmic proof of Suslin's stability theorem for polynomial rings J. Algebra 178 1995 277-298
8. A. Suslin On the structure of the special linear group over polynomial rings Math. USSR-Izv. 11 1977 221-238
9. Yengui I. 2004 Making the use of maximal ideals constructive (preprint)