Suslin¿s algorithms for reduction of unimodular rows

• Autores: Henri Lombardi, Ihsen Yengui
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 39, Nº 6, 2005, págs. 707-717
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • A well-known lemma of Suslin says that for a commutative ring if is unimodular where v1 is monic and n=3, then there exist such that the ideal generated by equals . This lemma played a central role in the resolution of Serre¿s Conjecture. In the case where contains a set E of cardinality greater than degv1+1 such that y-y' is invertible for each y?y' in E, we prove that the ?i can simply correspond to the elementary operations , 1=i=l=degv1+1, where u1v1++unvn=1. These efficient elementary operations enable us to give new and simple algorithms for reducing unimodular rows with entries in to using elementary operations in the case where is an infinite field. Another feature of this paper is that it shows that the concrete local¿global principles can produce competitive complexity bounds.