Search arXivSearch

arXiv · 2309.17251

CM-values of $p$-adic $Θ$-functions

Abstract

We prove a $p$-adic version of the work by Gross and Zagier on the differences between singular moduli by proving a set of conjectures by Giampietro and Darmon, who investigated the factorisation of a rational invariant associated to a pair of CM-points on a genus zero Shimura curve, obtained as the ratio of the CM-values of $p$-adic $Θ$-functions. As did Gross and Zagier, we give two proofs; an algebraic proof using CM-theory, and more interestingly, also an analytic proof using $p$-adic infinitesimal deformations of Hilbert Eisenstein series. Since there are no explicit formulae for its cuspidal $p$-adic deformations, we instead compute the Frobenius traces of the appropriate Galois deformation, and show their modularity via an $R = T$ theorem. This approach aims to bridge the gap between classical CM-theory and the more recent $p$-adic advances in the theory of real multiplication.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael A. Daas. 2023-09-29. CM-values of $p$-adic $Θ$-functions. https://arxiv.org/abs/2309.17251

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