Search arXivSearch

arXiv · 1907.03417

Mass formulas and Eisenstein congruences in higher rank

Abstract

We use mass formulas to construct minimal parabolic Eisenstein congruences for algebraic modular forms on reductive groups compact at infinity, and study when these yield congruences between cusp forms and Eisenstein series on the quasi-split inner form. This extends recent work of the first author on weight 2 Eisenstein congruences for GL(2) to higher rank. Two issues in higher rank are that the transfer to the quasi-split form is not always cuspidal and sometimes the congruences come from lower rank (e.g., are "endoscopic"). We show our construction yields Eisenstein congruences with non-endoscopic cuspidal automorphic forms on quasi-split unitary groups by using certain unitary groups over division algebras. On the other hand, when using unitary groups over fields, or other groups of Lie type, these Eisenstein congruences typically appear to be endoscopic. This suggests a new way to see higher weight Eisenstein congruences for GL(2), and leads to various conjectures about GL(2) Eisenstein congruences. In supplementary sections, we also generalize previous weight 2 Eisenstein congruences for Hilbert modular forms, and prove some special congruence mod p results between cusp forms on U(p).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kimball Martin, Satoshi Wakatsuki. 2019-07-08. Mass formulas and Eisenstein congruences in higher rank. https://doi.org/10.1016/j.jnt.2023.10.004

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