Asymptotic formula of the number of Newton polygons (Q2223503): Difference between revisions

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.