Asymptotic formula of the number of Newton polygons

From MaRDI portal
Publication:2223503



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.


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.





Describes a project that uses

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)