$p$-adic monodromy and mod $p$ unlikely intersections, I

Ruofan Jiang

Home/Archive/arXiv

arXiv · 2308.06854

$p$-adic monodromy and mod $p$ unlikely intersections, I

Ruofan Jiang

View original source ↗Read source document ↗Export metadata ↓

Abstract

We formulate characteristic $p$ analogues of the Mumford--Tate and the André--Oort conjectures for ordinary mod $p$ Shimura varieties of Hodge type, and set up general frameworks for studying them. We prove the two conjectures for (subvarieties of) arbitrary products of GSpin Shimura varieties, by reducing them, via a notion of linearity for mod $p$ Shimura varieties, to a third conjecture of Ax--Schanuel type. Along the way, we solve Chai's Tate-linear conjecture for products of GSpin Shimura varieties, and reveal an intimate relation among the four conjectures mentioned above. Our proof uses Crew's parabolicity conjecture which is recently proven by D'Addezio.

Explore related subjects

math.NT math.AG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Ruofan Jiang. 2025-11-29. $p$-adic monodromy and mod $p$ unlikely intersections, I. https://arxiv.org/abs/2308.06854

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

Integers for Simple Radical Extensions

The ring of integers and the discriminant are determined for number fields which are simple radical extensions.

math.NT↗

arXiv2026

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↗