Search arXivSearch

arXiv · 2503.06210

Refined Upper Bounds for $L(1,χ)$

Abstract

Let $χ$ be a non-principal Dirichlet character of modulus $q$ with associated \textit{L}-function $L(s,χ)$. We prove that $$|L(1,χ)|\le\left(\frac{1}{2}+O\Big(\frac{\log\log q}{\log q}\Big)\right)\frac{φ(q)}{q}\log q\,,$$ where $φ(\cdot)$ is Euler's phi function. This refines known bounds of the form $(c+o(1))\log q $ or $(c+O(\frac{1}{\log q}))\log q $ and is relevant for prime-rich moduli. It follows from Mertens' third theorem and the prime number theorem that $\inf_{q>2}\max_{χ\neχ_0\,(\mod q)}\frac{|L(1,χ)|}{\log q/\log\log q}\le\frac{1}{2}e^{-γ}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jeffery Ezearn. 2025-03-08. Refined Upper Bounds for $L(1,χ)$. https://arxiv.org/abs/2503.06210

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