Search arXivSearch

arXiv · 1710.00137

Generic Newton polygon for exponential sums in $n$ variables with parallelotope base

Abstract

Let $p$ be a prime number. Every $n$-variable polynomial $f(\underline x)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of varieties whose Galois group is isomorphic to $\mathbb{Z}_p$. Our goal of this paper is to study the Newton polygon of the $L$-function associated to a finite character of $\mathbb{Z}_p$ and a generic polynomial whose convex hull is an $n$-dimensional paralleltope $Δ$. We denote this polygon by $\mathrm{GNP}(Δ)$. We prove a lower bound of $\mathrm{GNP}(Δ)$, which is called the improved Hodge polygon $\mathrm{IHP}(Δ)$. We show that $\mathrm{IHP}(Δ)$ lies above the usual Hodge polygon $\mathrm{HP}(Δ)$ at certain infinitely many points, and when $p$ is larger than a fixed number determined by $Δ$, it coincides with $\mathrm{GNP}(Δ)$ at these points. As a corollary, we roughly determine the distribution of the slopes of $\mathrm{GNP}(Δ)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rufei Ren. 2020-03-12. Generic Newton polygon for exponential sums in $n$ variables with parallelotope base. https://doi.org/10.1353/ajm.2020.0040

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT