Higher newton polygons and integral bases

Jordi Guàrdia, Jesús Montes, Enric Nart

Research output: Contribution to journalArticleResearchpeer-review

7 Citations (Scopus)

Abstract

© 2014 Elsevier Inc. Let A be a Dedekind domain whose field of fractions K is a global field. Let p be a non-zero prime ideal of A, and Kp the completion of K at p. The Montes algorithm factorizes a monic irreducible polynomial f∈. A[. x] over Kp, and provides essential arithmetic information about the finite extensions of Kp determined by the different irreducible factors. In particular, it can be used to compute a p-integral basis of the extension of K determined by f. In this paper we present a new and faster method to compute p-integral bases, based on the use of the quotients of certain divisions with remainder of f that occur along the flow of the Montes algorithm.
Original languageEnglish
Pages (from-to)549-589
JournalJournal of Number Theory
Volume147
DOIs
Publication statusPublished - 1 Feb 2015

Keywords

  • Dedekind domain
  • Global field
  • Local field
  • Montes algorithm
  • Newton polygon
  • P-integral bases
  • Reduced bases

Fingerprint Dive into the research topics of 'Higher newton polygons and integral bases'. Together they form a unique fingerprint.

Cite this