Finite monodromy of some families of exponential sums
Antonio Rojas-Leon

TL;DR
This paper provides a numerical criterion to determine when certain exponential sums over finite fields have finite monodromy, with explicit examples computed for specific cases.
Contribution
It introduces a new numerical criterion for finite monodromy of $ ext{l}$-adic sheaves associated with exponential sums and applies it to explicit cases.
Findings
Numerical criterion for finite monodromy established
Explicit computations for specific exponential sums
Criteria applicable to a range of cases
Abstract
Given a prime and an integer , we give a numerical criterion to decide whether the -adic sheaf associated to the one-parameter exponential sums over has finite monodromy or not, and work out some explicit cases where this is computable.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
