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 Edit this on Wikidata


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




Cites Work


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)