Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. Counting Sheaves Using Spherical Codes
 
research article

Counting Sheaves Using Spherical Codes

Fouvry, Etienne
•
Kowalski, Emmanuel
•
Michel, Philippe  
2013
Mathematical Research Letters

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 l-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 cannot usually be approximated by short linear combinations of trace functions of sheaves with small complexity.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

MRL-2013-0020-0002-a008.pdf

Access type

openaccess

Size

222.28 KB

Format

Adobe PDF

Checksum (MD5)

9aa93edf18037ae53daa27103e9880f5

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés