Asymptotic formula of the number of Newton polygons (Q2223503)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7303567
Language Label Description Also known as
default for all languages
No label defined
    English
    Asymptotic formula of the number of Newton polygons
    scientific article; zbMATH DE number 7303567

      Statements

      Asymptotic formula of the number of Newton polygons (English)
      0 references
      0 references
      29 January 2021
      0 references
      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.
      0 references
      0 references
      Newton polygons
      0 references
      asymptotic formula
      0 references
      Riemann hypothesis
      0 references
      central limit theorem
      0 references
      0 references
      0 references

      Identifiers