A fast algorithm to compute the Ramanujan-Deninger gamma-function and some number-theoretic applications
Alessandro Languasco, Luca Righi

TL;DR
This paper presents a fast algorithm for computing the Ramanujan-Deninger gamma function and its derivatives, enabling extensive numerical analysis of Euler-Kronecker constants and related number-theoretic quantities for large primes.
Contribution
The authors develop a new efficient algorithm for the Ramanujan-Deninger gamma function, allowing large-scale numerical investigations of key number-theoretic constants.
Findings
Computed Euler-Kronecker constants for large primes, including a new negative value.
Extended numerical results for primes up to 10^7, confirming positivity of constants.
Established bounds for the maximum of derivatives of Dirichlet L-functions.
Abstract
We introduce a fast algorithm to compute the Ramanujan-Deninger gamma function and its logarithmic derivative at positive values. Such an algorithm allows us to greatly extend the numerical investigations about the Euler-Kronecker constants , and , where is an odd prime, runs over the primitive Dirichlet characters , is the trivial Dirichlet character and is the Dirichlet -function associated to . Using such algorithms we obtained that and thus getting a new negative value for . Moreover we also computed , and for every odd prime , , thus extending previous…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
