Search arXivSearch

arXiv · 2306.10991

Modular relations involving generalized digamma functions

Abstract

Generalized digamma functions $ψ_k(x)$, studied by Ramanujan, Deninger, Dilcher, Kanemitsu, Ishibashi etc., appear as the Laurent series coefficients of the zeta function associated to an indefinite quadratic form. In this paper, a modular relation of the form $F_k(α)=F_k(1/α)$ containing infinite series of $ψ_k(x)$, or, equivalently, between the generalized Stieltjes constants $γ_k(x)$, is obtained for any $k\in\mathbb{N}$. When $k=0$, it reduces to a famous transformation given on page $220$ of Ramanujan's Lost Notebook. For $k=1$, an integral containing Riemann's $Ξ$-function, and corresponding to the aforementioned modular relation, is also obtained along with its asymptotic expansions as $α\to0$ and $α\to\infty$. Carlitz-type and Guinand-type finite modular relations involving $ψ_j^{(m)}(x), 0\leq j\leq k, m\in\mathbb{N}\cup\{0\},$ are also derived, thereby extending previous results on the digamma function $ψ(x)$. The extension of Guinand's result for $ψ_j^{(m)}(x), m\geq2,$ involves an interesting combinatorial sum $h(r)$ over integer partitions of $2r$ into exactly $r$ parts. This sum plays a crucial role in an inversion formula needed for this extension. This formula has connection with the inversion formula for the inverse of a triangular Toeplitz matrix. The modular relation for $ψ_j'(x)$ is subtle and requires delicate analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Atul Dixit, Sumukha Sathyanarayana, N. Guru Sharan. 2023-06-22. Modular relations involving generalized digamma functions. https://arxiv.org/abs/2306.10991

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