On the computation of all extensions of a 𝑝-adic field of a given degree

  • Pauli S
  • Roblot X
38Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Let k \mathbf {k} be a p p -adic field. It is well-known that k \mathbf {k} has only finitely many extensions of a given finite degree. Krasner has given formulae for the number of extensions of a given degree and discriminant. Following his work, we present an algorithm for the computation of generating polynomials for all extensions K / k \mathbf {K}/\mathbf {k} of a given degree and discriminant.

Cite

CITATION STYLE

APA

Pauli, S., & Roblot, X.-F. (2001). On the computation of all extensions of a 𝑝-adic field of a given degree. Mathematics of Computation, 70(236), 1641–1659. https://doi.org/10.1090/s0025-5718-01-01306-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free