Search arXivSearch

arXiv · 2405.06456

Some uniform effective results on André--Oort for sums of powers in $\mathbb{C}^n$

Abstract

We prove an André--Oort-type result for a family of hypersurfaces in $\mathbb{C}^n$ that is both uniform and effective. Let $K_*$ denote the single exceptional imaginary quadratic field which occurs in the Siegel--Tatuzawa lower bound for the class number. We prove that, for $m, n \in \mathbb{Z}_{>0}$, there exists an effective constant $c(m, n)>0$ with the following property: if pairwise distinct singular moduli $x_1, \ldots, x_n$ with respective discriminants $Δ_1, \ldots, Δ_n$ are such that $a_1 x_1^m + \ldots + a_n x_n^m \in \mathbb{Q}$ for some $a_1, \ldots, a_n \in \mathbb{Q} \setminus \{0\}$ and $\# \{ Δ_i : \mathbb{Q}(\sqrt{Δ_i}) = K_*\} \leq 1$, then $\max_i \lvert Δ_i \rvert \leq c(m, n)$. In addition, we prove an unconditional and completely explicit version of this result when $(m, n) = (1, 3)$ and thereby determine all the triples $(x_1, x_2, x_3)$ of singular moduli such that $a_1 x_1 + a_2 x_2 + a_3 x_3 \in \mathbb{Q}$ for some $a_1, a_2, a_3 \in \mathbb{Q} \setminus \{0\}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guy Fowler. 2025-11-03. Some uniform effective results on André--Oort for sums of powers in $\mathbb{C}^n$. https://doi.org/10.1017/s0305004125101825

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