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
Parents
60
1–5 of 60
52
7
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 52
40

University of Göttingen
Göttingen, Germany
5 h-index
7 publications
558 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
4 h-index
4 publications
165 citations
The Ohio State University
Columbus, United States
4 h-index
4 publications
80 citations
Shandong University
Jinan, China
4 h-index
4 publications
100 citations
ETH Zurich
Zurich, Switzerland
3 h-index
3 publications
107 citations
Texas A&M University
College Station, United States
3 h-index
7 publications
543 citations
Stanford University
Stanford, United States
3 h-index
3 publications
234 citations
University of Iowa
Iowa City, United States
3 h-index
3 publications
80 citations
1–8 of 40
DMJ · 6 publications · 287 citations
6
h-index
6 publications · 592 citations
6
h-index
Repository · 4 publications · 45 citations
4
h-index
3 publications · 38 citations
3
h-index
ANT · 3 publications · 48 citations
3
h-index
1–5