OpenAlex ·
Extreme values of quadratic Hecke $L$-functions
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.16807
- Original
- Read it at the publisher
- Topics
Abstract
We study large values of quadratic Hecke $L$-functions in the conductor aspect. Let $K$ be a fixed number field, and assume GRH for its finite-order Hecke $L$-functions. In a fixed ray class component with conductor norm comparable to $X$, we prove that \[ \max_χL\left(\frac12+\frac A{\log_2X},χ\right) \geq\exp\left\{(e^{-A}+o(1)) \sqrt{\frac{\log X\log_3X}{\log_2X}}\right\} \] for every fixed $A\geq0$. Every fixed smaller constant is attained by at least $X^{1-o(1)}$ characters. The same count holds at a suitably slowly moving threshold approaching the displayed constant. The combinatorial input is a sparse squarefree Gál set of cardinality $N$, retaining the known leading constant $2$ and having square multiplicative energy $N^{2+o(1)}$. The energy bound reflects the low degree of the associated Boolean polynomial. Together with the resonance estimate, it yields the abundance bound. We also prove unconditional analogues for quadratic characters with prime conductor away from one fixed place over any global function field of odd characteristic. Finally, we give bounds in the fixed strip and at $s=1$, including the dependence on the residue of the Dedekind zeta function and the prescribed local factors.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$
Branched real projective structures on surfaces and geometrisation of representations
Generalized DCCQ: From Binary Quotients to Multinomial Simplex Geometry and Critical-Strip Coordinates
Hamiltonicity in graphs defined by primes and primitive elements
The Drinfeld associator and $A_\infty$ functors
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.