Search arXivSearch

arXiv · 2302.02630

Eisenstein series, $p$-adic modular functions, and overconvergence, II

Abstract

Let $p$ be a prime number. Continuing and extending our previous paper with the same title, we prove explicit rates of overconvergence for modular functions of the form $\frac{E_k^{\ast}}{V(E_k^{\ast})}$ where $E_k^{\ast}$ is a classical, normalized Eisenstein series on $Γ_0(p)$ and $V$ the $p$-adic Frobenius operator. In particular, we extend our previous paper to the primes $2$ and $3$. For these primes our main theorem improves somewhat upon earlier results by Emerton, Buzzard and Kilford, and Roe. We include a detailed discussion of those earlier results as seen from our perspective. We also give some improvements to our earlier paper for primes $p\ge 5$. Apart from establishing these improvements, our main purpose here is also to show that all of these results can be obtained by a uniform method, i.e., a method where the main points in the argumentation is the same for all primes. We illustrate the results by some numerical examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ian Kiming, Nadim Rustom. 2023-02-06. Eisenstein series, $p$-adic modular functions, and overconvergence, II. https://doi.org/10.1007/s40993-023-00491-5

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