Search arXivSearch

arXiv · 1511.04302

The stable property of Newton slopes for general Witt towers

Abstract

Any polynomial $f(x)\in\mathbb{Z}_q[x]$ defines a Witt vector $[f]\in W(\mathbb{F}_q[x])$. Consider the Artin-Schreier-Witt tower $y^F-y=[f]$. This is a tower of curves over $\mathbb{F}_q$, with total Galois group $\mathbb{Z}_p$. We want to study the Newton slopes of zeta functions of this tower. We reduce it to the Newton polygons of L-functions associated with characters on the Galois groups. We prove that, when the conductors are large enough, these Newton slopes are unions of arithmetic progressions which are changing proportionally as the conductor increases. This is a generalization of the result of \cite{Da}, where they get the same result in the case the non-zero coefficients of $f(x)$ are roots of unity. To overcome the new difficulty in our process, we apply some $(p^θ,T)$-topology.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiang Li. 2017-11-13. The stable property of Newton slopes for general Witt towers. https://doi.org/10.1016/j.jnt.2017.08.035

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