Английская Википедия:Gregory coefficients
Gregory coefficients Шаблон:Math, also known as reciprocal logarithmic numbers, Bernoulli numbers of the second kind, or Cauchy numbers of the first kind,[1][2][3][4][5][6][7][8][9][10][11][12][13] are the rational numbers that occur in the Maclaurin series expansion of the reciprocal logarithm
- <math>
\begin{align} \frac{z}{\ln(1+z)} & = 1+\frac12 z - \frac{1}{12}z^2 + \frac{1}{24}z^3 - \frac{19}{720}z^4 + \frac{3}{160}z^5 - \frac{863}{60480}z^6 + \cdots \\ & = 1 + \sum_{n=1}^\infty G_n z^n\,,\qquad |z|<1\,. \end{align} </math>
Gregory coefficients are alternating Шаблон:Math for Шаблон:Math and decreasing in absolute value. These numbers are named after James Gregory who introduced them in 1670 in the numerical integration context. They were subsequently rediscovered by many mathematicians and often appear in works of modern authors, who do not always recognize them.[1][5][14][15][16][17]
Numerical values
Computation and representations
The simplest way to compute Gregory coefficients is to use the recurrence formula
- <math>
|G_n| = -\sum_{k=1}^{n-1} \frac{|G_k|}{n+1-k} + \frac 1 {n+1} </math>
with Шаблон:Math.[14][18] Gregory coefficients may be also computed explicitly via the following differential
- <math>
n! G_n=\left[\frac{\textrm d^n}{\textrm dz^n}\frac{z}{\ln(1+z)}\right]_{z=0}, </math>
or the integral
- <math>
G_n=\frac 1 {n!} \int_0^1 x(x-1)(x-2)\cdots(x-n+1)\, dx = \int_0^1 \binom x n \, dx, </math> which can be proved by integrating <math> (1+z)^x </math> between 0 and 1 with respect to <math> x </math>, once directly and the second time using the binomial series expansion first.
It implies the finite summation formula
- <math>
n! G_n= \sum_{\ell=0}^n \frac{s(n,\ell)}{\ell+1} , </math> where Шаблон:Math are the signed Stirling numbers of the first kind.
and Schröder's integral formula[19][20]
- <math>
G_n=(-1)^{n-1} \int_0^\infty \frac{dx}{(1+x)^n(\ln^2 x + \pi^2)}, </math>
Bounds and asymptotic behavior
The Gregory coefficients satisfy the bounds
- <math>
\frac{1}{6n(n-1)}<\big|G_n\big|<\frac{1}{6n},\qquad n>2, </math>
given by Johan Steffensen.[15] These bounds were later improved by various authors. The best known bounds for them were given by Blagouchine.[17] In particular,
- <math>
\frac{\,1\,}{\,n\ln^2\! n\,} \,-\, \frac{\,2\,}{\,n\ln^3\! n\,} \leqslant\,\big|G_n\big|\, \leqslant\, \frac{\,1\,}{\,n\ln^2\! n\,} - \frac{\,2\gamma \, }{\,n\ln^3\! n\,} \,, \qquad\quad n\geqslant5\,. </math>
Asymptotically, at large index Шаблон:Math, these numbers behave as[2][17][19]
- <math>
\big|G_n\big|\sim \frac{1}{n\ln^2 n}, \qquad n\to\infty. </math>
More accurate description of Шаблон:Math at large Шаблон:Math may be found in works of Van Veen,[18] Davis,[3] Coffey,[21] Nemes[6] and Blagouchine.[17]
Series with Gregory coefficients
Series involving Gregory coefficients may be often calculated in a closed-form. Basic series with these numbers include
- <math>
\begin{align} &\sum_{n=1}^\infty\big|G_n\big|=1 \\[2mm] &\sum_{n=1}^\infty G_n=\frac{1}{\ln2} -1 \\[2mm] &\sum_{n=1}^\infty \frac{\big|G_n\big|}{n}=\gamma, \end{align} </math>
where Шаблон:Math is Euler's constant. These results are very old, and their history may be traced back to the works of Gregorio Fontana and Lorenzo Mascheroni.[17][22] More complicated series with the Gregory coefficients were calculated by various authors. Kowalenko,[8] Alabdulmohsin [10][11] and some other authors calculated
- <math>
\begin{array}{l} \displaystyle \sum_{n=2}^\infty \frac{\big|G_n\big|}{n-1}= -\frac{1}{2} + \frac{\ln2\pi}{2} -\frac{\gamma}{2} \\[6mm] \displaystyle \displaystyle\sum_{n=1}^{\infty}\!\frac{\big|G_n\big|}{n+1}= 1- \ln2. \end{array} </math>
Alabdulmohsin[10][11] also gives these identities with
- <math>
\begin{align} & \sum_{n=0}^\infty (-1)^n (\big|G_{3n+1}\big| + \big|G_{3n+2}\big|) = \frac{\sqrt{3}}{\pi} \\[2mm] & \sum_{n=0}^\infty (-1)^n (\big|G_{3n+2}\big| + \big|G_{3n+3}\big|) = \frac{2\sqrt{3}}{\pi} - 1 \\[2mm] & \sum_{n=0}^\infty (-1)^n (\big|G_{3n+3}\big| + \big|G_{3n+4}\big|) = \frac{1}{2}- \frac{\sqrt{3}}{\pi}. \end{align} </math>
Candelperger, Coppo[23][24] and Young[7] showed that
- <math>
\sum_{n=1}^\infty \frac{\big|G_n\big|\cdot H_n}{n}=\frac{\pi^2}{6}-1, </math>
where Шаблон:Math are the harmonic numbers. Blagouchine[17][25][26][27] provides the following identities
- <math>
\begin{align} & \sum_{n=1}^\infty \frac{G_n}{n} =\operatorname{li}(2)-\gamma \\[2mm] & \sum_{n=3}^\infty \frac{\big|G_n\big|}{n-2} = -\frac{1}{8} + \frac{\ln2\pi}{12} - \frac{\zeta'(2)}{\,2\pi^2}\\[2mm] & \sum_{n=4}^\infty \frac{\big|G_n\big|}{n-3} = -\frac{1}{16} + \frac{\ln2\pi}{24} - \frac{\zeta'(2)}{4\pi^2} + \frac{\zeta(3)}{8\pi^2}\\[2mm] & \sum_{n=1}^\infty \frac{\big|G_n\big|}{n+2} =\frac{1}{2}-2\ln2 +\ln3 \\[2mm] & \sum_{n=1}^\infty \frac{\big|G_n\big|}{n+3} =\frac{1}{3}-5\ln2+3\ln3 \\[2mm] & \sum_{n=1}^\infty \frac{\big|G_n\big|}{n+k} =\frac{1}{k}+\sum_{m=1}^k (-1)^m \binom{k}{m}\ln(m+1) \,, \qquad k=1, 2, 3,\ldots\\[2mm] & \sum_{n=1}^\infty \frac{\big|G_n\big|}{n^2} =\int_0^1 \frac{-\operatorname{li}(1-x)+\gamma+\ln x} x \, dx \\[2mm] & \sum_{n=1}^\infty \frac{G_n}{n^2} =\int_0^1\frac{\operatorname{li}(1+x)-\gamma-\ln x}{x}\, dx, \end{align} </math>
where Шаблон:Math is the integral logarithm and <math>\tbinom{k}{m}</math> is the binomial coefficient. It is also known that the zeta function, the gamma function, the polygamma functions, the Stieltjes constants and many other special functions and constants may be expressed in terms of infinite series containing these numbers.[1][17][18][28][29]
Generalizations
Various generalizations are possible for the Gregory coefficients. Many of them may be obtained by modifying the parent generating equation. For example, Van Veen[18] consider
- <math>
\left(\frac{\ln(1+z)}{z}\right)^s= s\sum_{n=0}^\infty \frac{z^n}{n!}K^{(s)}_n \,,\qquad |z|<1\,, </math>
and hence
- <math>
n!G_n=-K_n^{(-1)} </math>
Equivalent generalizations were later proposed by Kowalenko[9] and Rubinstein.[30] In a similar manner, Gregory coefficients are related to the generalized Bernoulli numbers
- <math>
\left(\frac{t}{e^t-1}\right)^s= \sum_{k=0}^\infty \frac{t^k}{k!} B^{(s)}_k , \qquad |t|<2\pi\,, </math>
- <math>
n!G_n=-\frac{B_n^{(n-1)}}{n-1} </math>
Jordan[1][16][31] defines polynomials Шаблон:Math such that
- <math>
\frac{z(1+z)^s}{\ln(1+z)}= \sum_{n=0}^\infty z^n \psi_n(s) \,,\qquad |z|<1\,, </math>
and call them Bernoulli polynomials of the second kind. From the above, it is clear that Шаблон:Math. Carlitz[16] generalized Jordan's polynomials Шаблон:Math by introducing polynomials Шаблон:Math
- <math>
\left(\frac{z}{\ln(1+z)}\right)^s \!\!\cdot (1+z)^x= \sum_{n=0}^\infty \frac{z^n}{n!}\,\beta^{(s)}_n(x) \,,\qquad |z|<1\,, </math>
and therefore
- <math>
n!G_n=\beta^{(1)}_n(0) </math>
Blagouchine[17][32] introduced numbers Шаблон:Math such that
- <math>
n!G_n(k)=\sum_{\ell=1}^n \frac{s(n,\ell)}{\ell+k} , </math>
obtained their generating function and studied their asymptotics at large Шаблон:Math. Clearly, Шаблон:Math. These numbers are strictly alternating Шаблон:Math and involved in various expansions for the zeta-functions, Euler's constant and polygamma functions. A different generalization of the same kind was also proposed by Komatsu[31]
- <math>
c_n^{(k)}=\sum_{\ell=0}^n \frac{s(n,\ell)}{(\ell+1)^k}, </math>
so that Шаблон:Math Numbers Шаблон:Math are called by the author poly-Cauchy numbers.[31] Coffey[21] defines polynomials
- <math>
P_{n+1}(y)=\frac 1 {n!} \int_0^y x(1-x)(2-x)\cdots(n-1-x)\, dx </math>
and therefore Шаблон:Math.
See also
References
- ↑ 1,0 1,1 1,2 1,3 Ch. Jordan. The Calculus of Finite Differences Chelsea Publishing Company, USA, 1947.
- ↑ 2,0 2,1 L. Comtet. Advanced combinatorics (2nd Edn.) D. Reidel Publishing Company, Boston, USA, 1974.
- ↑ 3,0 3,1 H.T. Davis. The approximation of logarithmic numbers. Amer. Math. Monthly, vol. 64, no. 8, pp. 11–18, 1957.
- ↑ P. C. Stamper. Table of Gregory coefficients. Math. Comp. vol. 20, p. 465, 1966.
- ↑ 5,0 5,1 D. Merlini, R. Sprugnoli, M. C. Verri. The Cauchy numbers. Discrete Math., vol. 306, pp. 1906–1920, 2006.
- ↑ 6,0 6,1 G. Nemes. An asymptotic expansion for the Bernoulli numbers of the second kind. J. Integer Seq, vol. 14, 11.4.8, 2011
- ↑ 7,0 7,1 P.T. Young. A 2-adic formula for Bernoulli numbers of the second kind and for the Nörlund numbers. J. Number Theory, vol. 128, pp. 2951–2962, 2008.
- ↑ 8,0 8,1 V. Kowalenko. Properties and Applications of the Reciprocal Logarithm Numbers. Acta Appl. Math., vol. 109, pp. 413–437, 2010.
- ↑ 9,0 9,1 V. Kowalenko. Generalizing the reciprocal logarithm numbers by adapting the partition method for a power series expansion. Acta Appl. Math., vol. 106, pp. 369–420, 2009.
- ↑ 10,0 10,1 10,2 I. M. Alabdulmohsin. Summability calculus, arXiv:1209.5739, 2012.
- ↑ 11,0 11,1 11,2 I. M. Alabdulmohsin. Summability calculus: a Comprehensive Theory of Fractional Finite Sums, Springer International Publishing, 2018.
- ↑ F. Qi and X.-J. Zhang An integral representation, some inequalities, and complete monotonicity of Bernoulli numbers of the second kind. Bull. Korean Math. Soc., vol. 52, no. 3, pp. 987–98, 2015.
- ↑ Weisstein, Eric W. "Logarithmic Number." From MathWorld—A Wolfram Web Resource.
- ↑ 14,0 14,1 J. C. Kluyver. Euler's constant and natural numbers. Proc. K. Ned. Akad. Wet., vol. 27(1-2), 1924.
- ↑ 15,0 15,1 J.F. Steffensen. Interpolation (2nd Edn.). Chelsea Publishing Company, New York, USA, 1950.
- ↑ 16,0 16,1 16,2 L. Carlitz. A note on Bernoulli and Euler polynomials of the second kind. Scripta Math., vol. 25, pp. 323–330,1961.
- ↑ 17,0 17,1 17,2 17,3 17,4 17,5 17,6 17,7 Ia.V. Blagouchine. Two series expansions for the logarithm of the gamma function involving Stirling numbers and containing only rational coefficients for certain arguments related to Шаблон:Pi−1. J.Math. Anal. Appl., 2015.
- ↑ 18,0 18,1 18,2 18,3 18,4 S.C. Van Veen. Asymptotic expansion of the generalized Bernoulli numbers Bn(n − 1) for large values of n (n integer). Indag. Math. (Proc.), vol. 13, pp. 335–341, 1951.
- ↑ 19,0 19,1 I. V. Blagouchine, A Note on Some Recent Results for the Bernoulli Numbers of the Second Kind, Journal of Integer Sequences, Vol. 20, No. 3 (2017), Article 17.3.8 arXiv:1612.03292
- ↑ Ernst Schröder, Zeitschrift fur Mathematik und Physik, vol. 25, pp. 106–117 (1880)
- ↑ 21,0 21,1 M.W. Coffey. Series representations for the Stieltjes constants. Rocky Mountain J. Math., vol. 44, pp. 443–477, 2014.
- ↑ Ia.V. Blagouchine. A theorem for the closed-form evaluation of the first generalized Stieltjes constant at rational arguments and some related summations J. Number Theory, vol. 148, pp. 537–592 and vol. 151, pp. 276–277, 2015.
- ↑ B. Candelpergher and M.-A. Coppo. A new class of identities involving Cauchy numbers, harmonic numbers and zeta values. Ramanujan J., vol. 27, pp. 305–328, 2012.
- ↑ B. Candelpergher and M.-A. Coppo. A new class of identities involving Cauchy numbers, harmonic numbers and zeta values. Ramanujan J., vol. 27, pp. 305–328, 2012
- ↑ Шаблон:OEIS2C
- ↑ Шаблон:OEIS2C
- ↑ Шаблон:OEIS2C
- ↑ 28,0 28,1 N. Nörlund. Vorlesungen über Differenzenrechnung. Springer, Berlin, 1924.
- ↑ Ia.V. Blagouchine. Expansions of generalized Euler's constants into the series of polynomials in Шаблон:Pi−2 and into the formal enveloping series with rational coefficients only J. Number Theory, vol. 158, pp. 365–396, 2016.
- ↑ M. O. Rubinstein. Identities for the Riemann zeta function Ramanujan J., vol. 27, pp. 29–42, 2012.
- ↑ 31,0 31,1 31,2 Takao Komatsu. On poly-Cauchy numbers and polynomials, 2012.
- ↑ Ia.V. Blagouchine. Three Notes on Ser's and Hasse's Representations for the Zeta-functions Integers (Electronic Journal of Combinatorial Number Theory), vol. 18A, Article #A3, pp. 1–45, 2018. arXiv:1606.02044
