Asymptotic formula of the number of Newton polygons
A Newton polygon of height \(n\) is a lower convex line graph \(\xi\) over the interval \([0;n]\), with \(\xi(0)=0\) where all breaking points of \(\xi\) belong to \(\mathbb{Z}^2\). In this paper, the author investigates the asymptotic behavior of the number \(\mathcal{N}(n)\) of Newton polygons of height \(n\) with slopes \(\in[0;1)\) as \(n\to\infty\). The asymptotic formula of the logarithm of \(\mathcal{N}(n)\) contains growing oscillatory terms which come from non-trivial zeros of the Riemann zeta function. Thus, an estimation of the amplitude of the oscillating part is equivalent to the Riemann hypothesis.
- Asymptotische Aussagen über Partitionen
- Hardy-Ramanujan's asymptotic formula for partitions and the central limit theorem
- scientific article; zbMATH DE number 3968684 (Why is no real title available?)
- scientific article; zbMATH DE number 3294009 (Why is no real title available?)
- On the cohomology groups of moduli spaces of vector bundles on curves
- The Magma algebra system. I: The user language
- THE THEORY OF COMMUTATIVE FORMAL GROUPS OVER FIELDS OF FINITE CHARACTERISTIC
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)