Bounds for Kloosterman sums for GLn
Abstract
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ą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.
Fields of Study & Subjects
Advanced Algebra and Geometry
Analytic Number Theory Research
Publication details
- Journal / source
- Advances in Mathematics
- Volume
- 499
- Pages
- 111058–111058
- Publication date
- 28 May 2026
- Language
- EN