Search arXivSearch

arXiv · 2005.02340

Automorphic Schwarzian equations and integrals of weight 2 forms

Abstract

In this paper, we investigate the non-modular solutions to the Schwarz differential equation $\{f,τ\}=sE_4(τ)$ where $E_4(τ)$ is the weight 4 Eisenstein series and $s$ is a complex parameter. In particular, we provide explicit solutions for each $s=2π^2(n/6)^2$ with $n\equiv 1\mod 12$. These solutions are obtained as integrals of meromorphic weight 2 modular forms. As a consequence, we find explicit solutions to the differential equation $\displaystyle y''+\frac{π^2n^2}{36}\,E_4\,y=0$ for each $n\equiv 1\mod 12$ generalizing the work of Hurwitz and Klein on the case $n=1$. Our investigation relies on the theory of equivariant functions on the complex upper half-plane. This paper supplements a previous work where we determine all the parameters $s$ for which the above Schwarzian equation has a modular solution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abdellah Sebbar, Hicham Saber. 2020-05-05. Automorphic Schwarzian equations and integrals of weight 2 forms. https://arxiv.org/abs/2005.02340

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