Bounds for Kloosterman Sums for $\mathrm{GL}_n
In this paper power saving bounds for general Kloosterman sums for all Weyl elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound by D\k{a}browski and Reeder. This is achieved by representing the sums in an explicit way as exponential sums and bounding these through appli...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper power saving bounds for general Kloosterman sums for all Weyl
elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound
by D\k{a}browski and Reeder. This is achieved by representing the sums in an
explicit way as exponential sums and bounding these through applications of the
Weil bound. |
---|---|
DOI: | 10.48550/arxiv.2412.04976 |