Skip to main content
×
Home
    • Aa
    • Aa

Complexity of OM factorizations of polynomials over local fields

  • Jens-Dietrich Bauch (a1), Enric Nart (a1) and Hayden D. Stainsby (a1)
Abstract
Abstract

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$ . Let $ \mathcal{O} $ be the valuation ring, $\mathfrak{m}$ the maximal ideal and $F(x)\in \mathcal{O} [x] $ a monic separable polynomial of degree $n$ . Let $\delta = v(\mathrm{Disc} (F))$ . The Montes algorithm computes an OM factorization of $F$ . The single-factor lifting algorithm derives from this data a factorization of $F(\mathrm{mod~} {\mathfrak{m}}^{\nu } )$ , for a prescribed precision $\nu $ . In this paper we find a new estimate for the complexity of the Montes algorithm, leading to an estimation of $O({n}^{2+ \epsilon } + {n}^{1+ \epsilon } {\delta }^{2+ \epsilon } + {n}^{2} {\nu }^{1+ \epsilon } )$ word operations for the complexity of the computation of a factorization of $F(\mathrm{mod~} {\mathfrak{m}}^{\nu } )$ , assuming that the residue field of $k$ is small.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Complexity of OM factorizations of polynomials over local fields
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Complexity of OM factorizations of polynomials over local fields
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Complexity of OM factorizations of polynomials over local fields
      Available formats
      ×
Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

D. Ford , S. Pauli and X.-F. Roblot , ‘A fast algorithm for polynomial factorization over ${ \mathbb{Q} }_{p} $’, J. Théor. Nombres de Bordeaux 14 (2002) 151169.

J. Guàrdia , J. Montes and E. Nart , ‘Okutsu invariants and Newton polygons’, Acta Arith. 145 (2010) 83108.

J. Guàrdia , J. Montes and E. Nart , ‘Higher Newton polygons in the computation of discriminants and prime ideal decomposition in number fields’, J. Théor. Nombres Bordeaux 23 (2011) no. 3, 667696.

J. Guàrdia , J. Montes and E. Nart , ‘Newton polygons of higher order in algebraic number theory’, Trans. Amer. Math. Soc. 364 (2012) no. 1, 361416.

J. Guàrdia , E. Nart and S. Pauli , ‘Single-factor lifting and factorization of polynomials over local fields’, J. Symbolic Comput. 47 (2012) 13181346.

S. MacLane , ‘A construction for absolute values in polynomial rings’, Trans. Amer. Math. Soc. 40 (1936) 363395.

S. MacLane , ‘A construction for prime ideals as absolute values of an algebraic field’, Duke Math. J. 2 (1936) 492510.

E. Nart , ‘Okutsu–Montes representations of prime ideals of one-dimensional integral closures’, Publ. Mat. 55 (2011) no. 3, 261294.

Ø. Ore , ‘Zur Theorie der algebraischen Körper’, Acta. Math. 44 (1923) 219314.

Ø. Ore , ‘Newtonsche Polygone in der Theorie der algebraischen Körper’, Math. Ann. 99 (1928) 84117.

S. Pauli , ‘Factoring polynomials over local fields’, J. Symbolic Comput. 32 (2001) 533547.

A. Schönhage and V. Strassen , ‘Schnelle Multiplikation großer Zahlen’, Computing 7 (1971) 281292.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

LMS Journal of Computation and Mathematics
  • ISSN: -
  • EISSN: 1461-1570
  • URL: /core/journals/lms-journal-of-computation-and-mathematics
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Keywords:

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 18 *
Loading metrics...

Abstract views

Total abstract views: 60 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th July 2017. This data will be updated every 24 hours.