Search arXivSearch

arXiv · 2505.08570

On the CM exception to a generalization of the Stéphanois theorem

Abstract

There are two classical theorems related to algebraic values of the j-invariant: Schneider's theorem and the Stéphanois theorem. Schneider's theorem for the j-invariant states that the transcendence degree $\operatorname{trdeg} \mathbb{Q}(τ, j(τ)) \geq 1$ with the sole exception of CM points. In contrast, CM points do not constitute an exception to the Stéphanois theorem, which states $\operatorname{trdeg} \mathbb{Q}(q,j(q))\geq 1$ for the Fourier expansion ($q$-expansion) of the j-invariant, for any $q$. Schneider's theorem has been generalized to higher dimensions, and in particular holds for the Igusa invariants of a genus 2 curve. These functions have Fourier expansions, but a result of Stéphanois type is unknown. In this paper, we find that there are positive dimensional sources of exceptions to the generic behaviour expected in genus 2, and we discuss their relation to CM points. We utilize Humbert singular relations, putting them into the transcendental framework. The computations of the transcendence degree for CM points are conditional to Schanuel's conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Desirée Gijón Gómez. 2025-05-13. On the CM exception to a generalization of the Stéphanois theorem. https://arxiv.org/abs/2505.08570

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