Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Computing Igusa class polynomials
HTML articles powered by AMS MathViewer

by Marco Streng PDF
Math. Comp. 83 (2014), 275-309 Request permission

Abstract:

We bound the running time of an algorithm that computes the genus-two class polynomials of a primitive quartic CM-field $K$. This is in fact the first running time bound and even the first proof of correctness of any algorithm that computes these polynomials.

Essential to bounding the running time is our bound on the height of the polynomials, which is a combination of denominator bounds of Goren and Lauter and our own absolute value bounds. The absolute value bounds are obtained by combining Dupont’s estimates of theta constants with an analysis of the shape of CM period lattices (Section 8).

The algorithm is basically the complex analytic method of Spallek and van Wamelen, and we show that it finishes in time $\widetilde {O}(\Delta ^{7/2})$, where $\Delta$ is the discriminant of $K$. We give a complete running time analysis of all parts of the algorithm, and a proof of correctness including a rounding error analysis. We also provide various improvements along the way.

References
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC (2010): 11G15, 14K22, 11Y40
  • Retrieve articles in all journals with MSC (2010): 11G15, 14K22, 11Y40
Additional Information
  • Marco Streng
  • Affiliation: Department of Mathematics, VU University Amsterdam, De Boelelaan 1105, 1081 HV Amsterdam, The Netherlands
  • MR Author ID: 831652
  • Email: marco.streng@gmail.com
  • Received by editor(s): February 9, 2011
  • Received by editor(s) in revised form: January 23, 2012
  • Published electronically: May 20, 2013
  • Additional Notes: The results in this paper were part of the author’s Ph.D. thesis at Universiteit Leiden
    The author was partially supported by EPSRC grant number EP/G004870/1
  • © Copyright 2013 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 83 (2014), 275-309
  • MSC (2010): Primary 11G15; Secondary 14K22, 11Y40
  • DOI: https://doi.org/10.1090/S0025-5718-2013-02712-3
  • MathSciNet review: 3120590