Search arXivSearch

arXiv · 2607.23270

A lower bound for the distance between CM points on Shimura curves

Abstract

In this paper, we establish a quantitative Diophantine approximation result for complex multiplication (CM) points on Shimura curves. Specifically, we prove a lower bound for the distance between a sequence of CM points $P_n$ converging to a fixed CM point $P$ on a Shimura curve $X(D,1)$ in terms of the discriminant of the endomorphism rings of $P_n$. The proof exploits the complex geometry of the Fuchsian uniformization, the explicit matrix representation of the underlying quaternion algebra, and Liouville's inequality. We show that the distance between the corresponding fixed points $τ_n$ and $τ$ in the upper half-plane is bounded below by a positive constant times a negative power of the discriminant. This result provides a Shimura curve analogue of a result of Habegger on singular moduli and modular curves.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Rodriguez. 2026-07-25. A lower bound for the distance between CM points on Shimura curves. https://arxiv.org/abs/2607.23270

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