Search arXivSearch

arXiv · 2407.21447

Hecke Equivariance of Divisor Lifting with respect to Sesquiharmonic Maass Forms

Abstract

We investigate the properties of Hecke operator for sesquiharmonic Maass forms. We begin by proving Hecke equivariance of the divisor lifting with respect to sesquiharmonic Mass functions, which maps an integral weight meromorphic modular form to the holomorphic part of the Fourier expansion of a weight 2 sesquiharmonic Maass form. Using this Hecke equivariance, we show that the sesquiharmonic Maass functions, whose images under the hyperbolic Laplace operator are the Faber polynomials $J_n$ of the $j$-function, form a Hecke system analogous to $J_n$. By combining the Hecke equivariance of the divisor lifting with that of the Borcherds isomorphism, we extend Matsusaka's finding on the twisted traces of sesquiharmonic Maass functions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daeyeol Jeon, Soon-Yi Kang, Chang Heon Kim. 2026-02-10. Hecke Equivariance of Divisor Lifting with respect to Sesquiharmonic Maass Forms. https://arxiv.org/abs/2407.21447

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