Asymptotic formula of the number of Newton polygons
From MaRDI portal
Publication:2223503
DOI10.1007/S00209-020-02504-WzbMATH Open1460.11119arXiv1707.04801OpenAlexW3013532391MaRDI QIDQ2223503FDOQ2223503
Authors: Shushi Harashita
Publication date: 29 January 2021
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Abstract: In this paper, we enumerate Newton polygons asymptotically. The number of Newton polygons is computable by a simple recurrence equation, but unexpectedly the asymptotic formula of its logarithm contains growing oscillatory terms. As the terms come from non-trivial zeros of the Riemann zeta function, an estimation of the amplitude of the oscillating part is equivalent to the Riemann hypothesis.
Full work available at URL: https://arxiv.org/abs/1707.04801
Recommendations
Central limit and other weak theorems (60F05) (zeta (s)) and (L(s, chi)) (11M06) Analytic theory of partitions (11P82)
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- Asymptotische Aussagen über Partitionen
- On the cohomology groups of moduli spaces of vector bundles on curves
- THE THEORY OF COMMUTATIVE FORMAL GROUPS OVER FIELDS OF FINITE CHARACTERISTIC
- Hardy-Ramanujan's asymptotic formula for partitions and the central limit theorem
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Asymptotic formula of the number of Newton polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2223503)