Search arXivSearch

arXiv · 2609.25703

S-integrality for families of ordinary K3 surfaces and algebraicity theorems

Abstract

We prove an $S$-integrality theorem for special divisors on GSpin Shimura varieties in positive characteristic. Let $C$ be a generically ordinary curve in such a Shimura variety not contained in any special divisor. Then, for any increasing sequence of prime-to-$p$ positive integers $m_i$ and any finite set of closed points $S\subset C$, we prove that $C\setminus S$ meets the special divisor $Z(m_i)$ for all but finitely many $i$. The key new input is an algebraicity theorem for formal special endomorphisms which allows us to use techniques from Diophantine approximation. We prove this algebraicity theorem using a punctual monodromy theorem and a positive-characteristic analogue of the Mumford--Tate conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruofan Jiang, Ananth N. Shankar. 2026-09-22. S-integrality for families of ordinary K3 surfaces and algebraicity theorems. https://arxiv.org/abs/2609.25703

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