Bounds for Kloosterman sums on GL(n)

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10489827" target="_blank" >RIV/00216208:11320/24:10489827 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=JaHBTWGlbj" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=JaHBTWGlbj</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00208-023-02777-6" target="_blank" >10.1007/s00208-023-02777-6</a>

Result language
angličtina
Original language name
Bounds for Kloosterman sums on GL(n)
Original language description
This paper establishes power-saving bounds for Kloosterman sums associatedwith the long Weyl element for GL(n) for arbitrary n > 3, as well as for another type ofWeyl element of order 2. These bounds are obtained by establishing an explicit represen-tation as exponential sums. As an application we go beyond Sarnak's density conjecturefor the principal congruence subgroup of prime level. We also obtain power-saving boundsfor all Kloosterman sums on GL(4)
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GM21-00420M" target="_blank" >GM21-00420M: Universal Quadratic Forms and Class Numbers</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)