On the Computation of All Extensions of a p-Adic Field of a Given Degree
Résumé
Let k be a p-adic field. It is well-known that k has only finitely many extensions of a given finite degree. Krasner has given formulae for the number of extensions of k of a given degree and discriminant. Following his work, we present an algorithm for the computation of generating polynomials for all these extensions.
Domaines
Théorie des nombres [math.NT]
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...