Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1612.08434

Fake proofs for identities involving products of Eisenstein series

Kamal Khuri-Makdisi
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the workshop of the July 2016 Building Bridges 3 conference in Sarajevo, I presented the results from a joint article with W. Raji (Mathematische Annalen 2017, preprint arXiv:1402.1854). That article gave a proof of various linear relations between products of two Eisenstein series on $Γ(N)$, including an interesting identity related to the action of a Hecke operator on such a product. The real proofs involve some care to deal with issues of convergence. In this note we give "fake" proofs for these identities, ignoring the convergence issues; some of these fake proofs appeared in the workshop lecture as an amusing side note before I sketched the real proofs. Something in these fake proofs is quite suggestive, even though the proofs themselves are clearly invalid (and even produce wrong results). It would be interesting to understand what exactly is going on here.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kamal Khuri-Makdisi. 2018-09-12. Fake proofs for identities involving products of Eisenstein series. https://arxiv.org/abs/1612.08434

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗