Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
