Search arXivSearch

arXiv · 2609.22544

Bad Reduction of Genus Two Curves with complex multiplication

Abstract

We study genus two curves whose Jacobians have complex multiplication by a biquadratic CM field. In this setting the Jacobian decomposes as a product of two elliptic curves with complex multiplication by orders in the same imaginary quadratic field. We derive upper bounds for the primes of stable bad reduction of such curves in terms of the discriminants of the CM orders. To do so, we give an explicit description of principally polarized abelian surfaces with CM by a biquadratic field via small CM cycles on an orthogonal Shimura variety of signature (3,2). We use it to prove an arithmetic intersection formula between such CM cycles with Humbert surfaces in terms of coefficients of incoherent Eisenstein series and representation numbers of ternary positive definite quadratic forms. Finally, employing the arithmetic properties of higher Green functions, we show that primes of stable bad reduction always exist.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Hendrik Bruinier, Tonghai Yang, Peng Yu. 2026-09-18. Bad Reduction of Genus Two Curves with complex multiplication. https://arxiv.org/abs/2609.22544

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