Search arXivSearch

arXiv · 2211.06120

Motivic local systems on curves and Maeda's conjecture

Abstract

We show that only finitely many complex genus two curves and four punctured spheres admit rank two local systems of geometric origin, and moreover each carries finitely many. This gives further counterexamples to a conjecture of Esnault and Kerz: counterexamples over very general curves were recently obtained by Landesman and Litt. In the second part we prove an analogue of this result in positive characteristic, namely that over $\overline{\mathbb{F}}_p$, only finitely many genus two curves admit non-trivial rank two local systems pulled back from a fixed quaternionic Shimura variety, and the same for $\mathbb{P}^1$ minus four points; conjecturally, every rank two local system arises as such a pullback. This provides results towards Maeda's conjecture on Galois orbits of eigenforms over function fields. The proofs make use of ideas from the work of Landesman and Litt such as isomonodromy, as well as crucially the description of the Goren-Oort strata due to Tian and Xiao.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yeuk Hay Joshua Lam. 2022-11-11. Motivic local systems on curves and Maeda's conjecture. https://arxiv.org/abs/2211.06120

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