A fast algorithm to compute the Ramanujan-Deninger gamma function and some number-theoretic applications

DOI10.1090/MCOM/3668zbMATH Open1469.11481arXiv2005.10046OpenAlexW3027473979MaRDI QIDQ4956930FDOQ4956930

Authors: Luca Righi, Alessandro Languasco 

Publication date: 2 September 2021

Published in: Mathematics of Computation (Search for Journal in Brave)

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 $mathfrak{G}_q$, $mathfrak{G}_q^{+}$ and $M_q=ma{x}_{chiech{i}_0}vert{L}^{p}rime/L(1,chi)vert$, where $q$ is an odd prime, $chi$ runs over the primitive Dirichlet characters $$, $ch{i}_0$ is the trivial Dirichlet character $$ and $L(s,chi)$ is the Dirichlet $L$-function associated to $chi$. Using such algorithms we obtained that $mathfrak{G}_{50040955631}=-0.16595399dotsc$ and $mathfrak{G}_{50040955631}^{+}=13.89764738dotsc$ thus getting a new negative value for $mathfrak{G}_q$. Moreover we also computed $mathfrak{G}_q$, $mathfrak{G}_q^{+}$ and $M_q$ for every odd prime $q$, $10^6<qle10^7$, thus extending previous results. As a consequence we obtain that both $mathfrak{G}_q$ and $mathfrak{G}_q^{+}$ are positive for every odd prime $q$ up to $10^7$ and that $frac1720loglogq<M_q<frac54loglogq$ for every odd prime $1531<qle10^7$. In fact the lower bound holds true for $q>13$. The programs used and the results here described are collected at the following address url{http://www.math.unipd.it/~languasc/Scomp-appl.html}.

Full work available at URL: https://arxiv.org/abs/2005.10046

Recommendations

• Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields
• Numerical verification of Littlewood's bounds for \(|L(1,\chi)|\)
• scientific article; zbMATH DE number 4116629
• Euler's constant, \(q\)-logarithms, and formulas of Ramanujan and Gosper
• Numerical computations concerning the GRH

zbMATH Keywords

Euler-Kronecker constantsapplication of fast Fourier transformextremal values for logarithmic derivative of Dirichlet \(L\)-functionsgeneralised gamma functions

Mathematics Subject Classification ID

Other functions defined by series and integrals (33E20) Number-theoretic algorithms; complexity (11Y16) Evaluation of number-theoretic constants (11Y60)

Cites Work

• Euler's constant: Euler's work and modern developments
• Multiplicative number theory. I. Classical theory
• A Stochastic Approach to the Gamma Function
• Number Theory
• Title not available (Why is that?)
• The Accuracy of Floating Point Summation
• Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
• Generalized Euler constants for arithmetical progressions
• On the analogue of the formula of Chowla and Selberg for real quadratic fields.
• On the logarithmic derivatives of Dirichlet L-functions at s=1
• The distribution of Euler-Kronecker constants of quadratic fields
• Values of the Euler \(\varphi\)-function not divisible by a given odd prime, and the distribution of Euler-Kronecker constants for cyclotomic fields
• On the Euler-Kronecker constants of global fields and primes with small norms
• On ``\(M\)-functions closely related to the distribution of \(L'/L\)-values
• Irregular behaviour of class numbers and Euler-Kronecker constants of cyclotomic fields: the log log log devil at play
• On generalized gamma functions related to the Laurent coefficients of the Riemann zeta function
• Computing Stieltjes constants using complex integration
• Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields
• Numerical verification of Littlewood's bounds for \(|L(1,\chi)|\)

Cited In (13)

• Landau and Ramanujan approximations for divisor sums and coefficients of cusp forms
• On Ihara’s conjectures for Euler–Kronecker constants
• Efficient computation of the Euler-Kronecker constants of prime cyclotomic fields
• A closed-form expression for the Euler-Kronecker constant of a quadratic field
• A fast algorithm for computing the digamma function
• Modular relations involving generalized digamma functions
• Conditional estimates for the logarithmic derivative of Dirichlet \(L\)-functions
• Lambert series of logarithm, the derivative of Deninger's function \(R(z)\), and a mean value theorem for \(\zeta \left (\frac{1}{2}-it\right)\zeta '\left (\frac{1}{2}+it\right)\)
• Fast computation of \(\zeta(3)\) and of some special integrals using the Ramanujan formula and polylogarithms
• A unified strategy to compute some special functions of number-theoretic interest
• Numerical estimates on the Landau-Siegel zero and other related quantities
• The Kummer ratio of the relative class number for prime cyclotomic fields
• Small Values of |L'/L(1,χ)|

Uses Software

• PARI/GP
• FFTW

This page was built for publication: A fast algorithm to compute the Ramanujan-Deninger gamma function and some number-theoretic applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956930)