Search arXivSearch

arXiv · 2405.02443

On extreme values of quadratic twists of Dirichlet-type $L$-functions

Abstract

In a recent work arXiv:2004.14450, it has been shown that $L$-functions associated with arbitrary non-zero cusp forms take large values at the central critical point. The goal of this note is to derive analogous results for twists of Dirichlet-type functions. More precisely, for an odd integer $q >1$, let $F$ be a non-zero $\mathbb{C}$-linear combination of primitive, complex, even Dirichlet characters of conductor $q$. We show that for any $ε>0$ and sufficiently large $X$, there are $\gg X^{1-ε}$ fundamental discriminants $8d$ with $X < d \leq 2X$ and ${(d, 2q)=1}$ such that ${|L(1/2, F \otimes χ_{8d})| }$ is large.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sanoli Gun, Rashi Lunia. 2024-05-03. On extreme values of quadratic twists of Dirichlet-type $L$-functions. https://arxiv.org/abs/2405.02443

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT