Search arXivSearch

arXiv · 2402.13127

Explicit upper bounds on the average of Euler-Kronecker constants of narrow ray class fields

Abstract

For a number field $K$, the Euler-Kronecker constant $γ_K$ associated to $K$ is an arithmetic invariant the size and nature of which is linked to some of the deepest questions in number theory. This theme was given impetus by Ihara who obtained bounds, both unconditional as well as under GRH for Dedekind zeta functions. In this note, we study the analogous constants associated to the narrow ray class fields of an imaginary quadratic field. Our goal for studying such families is twofold. First to show that for such families, the conditional bounds obtained by Ihara can be improved on the average, again under GRH for Dedekind zeta functions. Further, our family of number fields are non-abelian while such average bounds have earlier been studied for cyclotomic fields. The technical part of our work is to make the dependence of these upper bounds on the ambient number field explicit. Such explicit dependence is essential to further our objective.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neelam Kandhil, Rashi Lunia, Jyothsnaa Sivaraman. 2024-02-23. Explicit upper bounds on the average of Euler-Kronecker constants of narrow ray class fields. https://doi.org/10.1007/s40993-023-00472-8

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