Counting sheaves using spherical codes
From MaRDI portal
Abstract: Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of geometrically irreducible ell-adic middle-extension sheaves on a curve over a finite field which are pointwise pure of weight 0 and have bounded ramification and rank. As an application, we show that "random" functions defined on a finite field can not usually be approximated by short linear combinations of trace functions of sheaves with small complexity.
Recommendations
- Counting \(\ell\)-adic sheaves
- Publication:3484989
- scientific article; zbMATH DE number 5529005
- New methods for bounding the number of points on curves over finite fields
- Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes
Cited in
(9)- Stratification and averaging for exponential sums: bilinear forms with generalized Kloosterman sums
- Cancellation in algebraic twisted sums on \(\operatorname{GL}_m\)
- Zeros of Rankin-Selberg \(L\)-functions at the edge of the critical strip
- A study in sums of products
- On short sums of trace functions
- The distribution of the maximum of partial sums of Kloosterman sums and other trace functions
- Algebraic trace functions over the primes
- Lectures on applied ℓ-adic cohomology
- Quantitative sheaf theory
This page was built for publication: Counting sheaves using spherical codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q395056)
