Subconvexity Bounds

Subconvexity Bounds is a type of analytic estimate in number theory that provides upper bounds for L-functions which are sharper than the convexity bound derived from the Phragmén–Lindelöf principle, thereby capturing finer arithmetic information about automorphic forms and their associated zeta functions.

60

Publications

2.4K

Citations

52

Authors

40

Institutions

Publications per year

2017–2026

20

Variants

Subconvexity Estimates

Authors

52

  1. VB
    Valentin Blomer

    University of Göttingen, Germany

    7 publications · 366 citations

    7

    h-index

  2. RH
    Roman Holowinsky

    The Ohio State University, United States

    5 publications · 86 citations

    5

    h-index

  3. RM
    Ritabrata Munshi

    Tata Institute of Fundamental Research, India

    4 publications · 130 citations

    4

    h-index

  4. PM
    Philippe Michel

    Université Claude Bernard Lyon 1, France

    4 publications · 274 citations

    4

    h-index

  5. PD
    Paul D. Nelson

    American Psychological Association, United States

    3 publications · 85 citations

    3

    h-index

1–5 of 52

Venues

  1. Duke Mathematical Journal

    DMJ · 6 publications · 287 citations

    6

    h-index

  2. Annals of Mathematics

    6 publications · 592 citations

    6

    h-index

  3. arXiv (Cornell University)

    Repository · 4 publications · 45 citations

    4

    h-index

  4. Compositio Mathematica

    3 publications · 38 citations

    3

    h-index

  5. Algebra & Number Theory

    ANT · 3 publications · 48 citations

    3

    h-index

1–5