Exceptional units and Euclidean number fields

• Autores: Julien Houriet
• Localización: Archiv der Mathematik, ISSN 0003-889X, Vol. 88, Nº. 5, 2007, págs. 425-433
• Idioma: inglés
• DOI: 10.1007/s00013-006-1019-0
• Texto completo no disponible (Saber más ...)
• Resumen

  • By a result of H.W. Lenstra, one can prove that a number field is Euclidean with the aid of exceptional units. We describe two methods computing exceptional sequences, i.e., sets of units such that the difference of any two of them is still a unit. The second method is based on a graph theory algorithm for the maximum clique problem. This yielded 42 new Euclidean number fields in degrees 8, 9, 10, 11 and 12.