Resum
We develop a theory of arithmetic Newton polygons of higher order that provides the factorization of a separable polynomial over a p-adic field, together with relevant arithmetic information about the fields generated by the irreducible factors. This carries out a program suggested by Ø. Ore. As an application, we obtain fast algorithms to compute discriminants, prime ideal decomposition and integral bases of number fields. © 2011 American Mathematical Society.
| Idioma original | Anglès |
|---|---|
| Pàgines (de-a) | 361-416 |
| Revista | Transactions of the American Mathematical Society |
| Volum | 364 |
| Número | 1 |
| DOIs | |
| Estat de la publicació | Publicada - 1 de gen. 2012 |