Search arXivSearch

arXiv · 1803.10550

Eisenstein series for the Weil representation

Abstract

We compute the Fourier expansion of vector valued Eisenstein series for the Weil representation associated to an even lattice. To this end, we define certain twists by Dirichlet characters of the usual Eisenstein series associated to isotropic elements in the discriminant form of the underlying lattice. These twisted functions still form a generating system for the space of Eisenstein series but have better multiplicative properties than the individual Eisenstein series. We adapt a method of Bruinier and Kuss to obtain algebraic formulas for the Fourier coefficients of the twisted Eisenstein series in terms of special values of Dirichlet $L$-functions and representation numbers modulo prime powers of the underlying lattice. In particular, we obtain that the Fourier coefficients of the individual Eisenstein series are rational numbers. Additionally, we show that the twisted Eisenstein series are eigenforms of the Hecke operators on vector valued modular forms introduced by Bruinier and Stein.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Markus Schwagenscheidt. 2018-04-06. Eisenstein series for the Weil representation. https://doi.org/10.1016/j.jnt.2018.05.014

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