Abstract | ||
---|---|---|
Let k be a p-adic eld. It is well-known that k has only nitely many extensions of a given nite 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 of a given degree and discriminant. |
Year | DOI | Venue |
---|---|---|
2001 | 10.1090/S0025-5718-01-01306-0 | Math. Comput. |
Keywords | DocType | Volume |
. p-adic elds,eisenstein polynomials. the work of the rst author was supported in part by ism and fcar/cicma qu ebec.,p-ADIC field,wildly ramied extensions | Journal | 70 |
Issue | ISSN | Citations |
236 | 0025-5718 | 3 |
PageRank | References | Authors |
0.59 | 0 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sebastian Pauli | 1 | 3 | 0.59 |
Xavier-François Roblot | 2 | 12 | 4.71 |