Search arXivSearch

arXiv · 1610.04505

Schertz style class invariants for higher degree CM fields

Abstract

Special values of Siegel modular functions for $\operatorname{Sp} (\mathbb{Z})$ generate class fields of CM fields. They also yield abelian varieties with a known endomorphism ring. Smaller alternative values of modular functions that lie in the same class fields (class invariants) thus help to speed up the computation of those mathematical objects. We show that modular functions for the subgroup $Γ^0 (N)\subseteq \operatorname{Sp}(\mathbb{Z})$ yield class invariants under some splitting conditions on $N$, generalising results due to Schertz from classical modular functions to Siegel modular functions. We show how to obtain all Galois conjugates of a class invariant by evaluating the same modular function in CM period matrices derived from an \emph{$N$-system}. Such a system consists of quadratic polynomials with coefficients in the real-quadratic subfield satisfying certain congruence conditions modulo $N$. We also examine conditions under which the minimal polynomial of a class invariant is real. Examples show that we may obtain class invariants that are much smaller than in previous constructions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Enge, Marco Streng. 2025-05-12. Schertz style class invariants for higher degree CM fields. https://arxiv.org/abs/1610.04505

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