Displaying 21 – 40 of 384

Showing per page

A computer algorithm for finding new euclidean number fields

Roland Quême (1998)

Journal de théorie des nombres de Bordeaux

This article describes a computer algorithm which exhibits a sufficient condition for a number field to be euclidean for the norm. In the survey [3] p 405, Franz Lemmermeyer pointed out that 743 number fields where known (march 1994) to be euclidean (the first one, , discovered by Euclid, three centuries B.C.!). In the first months of 1997, we found more than 1200 new euclidean number fields of degree 4, 5 and 6 with a computer algorithm involving classical lattice properties of the embedding of...

A determinant formula for the relative class number of an imaginary abelian number field

Mikihito Hirabayashi (2014)

Communications in Mathematics

We give a new formula for the relative class number of an imaginary abelian number field K by means of determinant with elements being integers of a cyclotomic field generated by the values of an odd Dirichlet character associated to K . We prove it by a specialization of determinant formula of Hasse.

Currently displaying 21 – 40 of 384