International Journal of Mathematics and M Computer Science, 9(2014), no. 1, 11–30 CS
Contributions to the Theory of the Barnes Function
Victor S. Adamchik
Computer Science Department Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PA 15213, USA
email: [email protected]
(Received November 13, 2013, Accepted May 10, 2014)
Abstract
This paper presents a family of new integral representations and asymptotic series of the multiple gamma function. The numerical schemes for high-precision computation of the Barnes gamma function and Glaisher’s constant are also discussed.
1 Introduction
In a sequence of papers published between 1899-1904, Barnes introduced and studied (see [9, 10, 11, 12]) a generalization of the classical Euler gamma function, called the multiple gamma function Γn(z). The function Γn(z) satisfies the following recurrence-functional equation [31, 32]:
Γn+1(z) Γn+1(z +1)= ,z∈ C,n∈ N, Γn(z) (1.1) Γ1(z)=Γ(z),
Γn(1) = 1, Key words and phrases: Barnes function, gamma function, Riemann zeta function, Hurwitz zeta function, Stirling numbers, harmonic numbers, Glaisher’s constant. AMS (MOS) Subject Classifications: Primary 33E20, 11M35 Secondary 11Y. This work was supported by grant CCR-0204003 from the National Science Foundation. ISSN 1814-0432, 2014, http://ijmcs.future-in-tech.net 12 Victor S. Adamchik where Γ(z) is the Euler gamma function. The system (1.1) has a unique solution if we add the condition of convexity [32] dn+1 − n+1 z ≥ ,z>. ( 1) dzn+1 log Γn( ) 0 0
In this paper we aim at the most interesting case G(z)=1/Γ2(z), being the so-called double gamma function or the Barnes G-function:
G(z +1)=Γ(z) G(z),z∈ C,
G(1) = G(2) = G(3) = 1, d3 log G(z) ≥ 0,z>0. dz3 The G-function has several equivalent forms including the Weierstrass canonical product