Search arXivSearch

arXiv · 1805.06914

Newton Polygons Arising for Special Families of Cyclic Covers of the Projective Line

Abstract

By a result of Moonen, there are exactly 20 positive-dimensional families of cyclic covers of the projective line for which the Torelli image is open and dense in the associated Shimura variety. For each of these, we compute the Newton polygons, and the $μ$-ordinary Ekedahl--Oort type, occurring in the characteristic $p$ reduction of the Shimura variety. We prove that all but a few of the Newton polygons appear on the open Torelli locus. As an application, we produce multiple new examples of Newton polygons and Ekedahl--Oort types of Jacobians of smooth curves in characteristic $p$. Under certain congruence conditions on $p$, these include: the supersingular Newton polygon for genus $5,6,7$; fourteen new non-supersingular Newton polygons for genus $5-7$; eleven new Ekedahl--Oort types for genus $4-7$ and, for all $g \geq 6$, the Newton polygon with $p$-rank $g-6$ with slopes $1/6$ and $5/6$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wanlin Li, Elena Mantovan, Rachel Pries, Yunqing Tang. 2018-12-22. Newton Polygons Arising for Special Families of Cyclic Covers of the Projective Line. https://doi.org/10.1007/s40993-018-0149-3

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