Papers
Topics
Authors
Recent
Search
2000 character limit reached

Matrix Kloosterman sums

Published 2 Sep 2021 in math.NT | (2109.00762v4)

Abstract: We study a family of exponential sums that arises in the study of the horocyclic flow on $\mathrm{GL}_n$. We prove an explicit version of general purity and find optimal bounds for these sums.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up