On the local \(L^2\)-bound of the Eisenstein series (Q6603919)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the local \(L^2\)-bound of the Eisenstein series |
scientific article; zbMATH DE number 7912274
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the local \(L^2\)-bound of the Eisenstein series |
scientific article; zbMATH DE number 7912274 |
Statements
On the local \(L^2\)-bound of the Eisenstein series (English)
0 references
12 September 2024
0 references
This paper study the growth of the local \(L^2\)-norms of the unitary Eisenstein series for reductive groups over number fields, in terms of their parameters. The authors derive a poly-logarithmic bound on an average, for a large class of reductive groups. The method is based on Arthur's development of the spectral side of the trace formula, and ideas of Finis, Lapid and Müller.\N\NThe results have interesting application on a couple of counting problems. One is an upper bound on matrices in the principal congruence group \(\Gamma(q)=\text{ker}(SL_n({\mathbb{Z}})\mapsto SL_n({\mathbb{Z}}/q{\mathbb{Z}}))\) whose norm is bounded by a positive number \(R\) (here \(q\) is a square free integer). The other is an upper bound on number of elements in \(SL_n({\mathbb{Z}}/q{\mathbb{Z}})\) whose lifts to \(SL_n({\mathbb{Z}})\) have norms all bigger than \(q^{1+\frac{1}{n}+\epsilon}\). Previously Assing-Blomer proved the bounds conditionally as an application of their proof of Sarnak's density conjecture, but relying on a technical hypothesis on the size of truncated Eisenstein series. Here the authors are able to establish the bounds unconditionally, without proving Assing-Blomer's hypothesis, but rather rely on the ideas they used in establishing bounds for \(L^2\) norms (and Assing-Blomer's result on density conjecture).
0 references
Eisenstein series
0 references
Arthur trace formula
0 references
poly-logarithmic bound
0 references
optimal lifting
0 references
0 references
0 references
0 references
0 references
0 references
0 references