Bounds for Kloosterman Sums for GLn
Abstract
In this paper power saving bounds for general Kloosterman sums for all Weyl elements for GLn 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.