Summation formulae on reciprocal sequences
type: Item
instance of: scholarly article
title: Summation formulae on reciprocal sequences
zbMATH Open document ID: 1125.05012
author: Pierluigi Magli
author: Wenchang Chu
published in: European Journal of Combinatorics
publication date: 2007-03-27T00:00:00Z
review text: Given a sequence \(\{a_n\}_{n\geq0}\) of complex numbers, the reviewer [Eur. J. Comb. 24, 709--718 (2003; Zbl 1024.05010)] introduced its dual sequence \(\{a_n^*\}_{n\geq0}\) with \(a_n^*=\sum_{k=0}^n\binom {n}{k}(-1)^ka_k\), and set \[ A_n(x)=\sum_{k=0}^n\binom{n}{k}(-1)^ka_kx^{n-k}\quad \text{and}\quad A_n^*(x)=\sum_{k=0}^n\binom{n}{k}(-1)^ka_k^*x^{n-k}. \] Note that \(A_n^*(1-x)=(-1)^nA_n(x)\) and \(A'_{n+1}(x)=(n+1)A_n(x)\). Thus we can restate two main identities ((1.5) and (1.4)) in the paper of the reviewer as follows: \[ \sum_{k=0}^m\binom{m}k(x-y)^{m-k}A_{n+k}(y)= \sum_{k=0}^n\binom{n}k(y-x)^{n-k}A_{m+k}(x) \tag \(*\) \] and \[ \begin{multlined} \sum_{k=0}^m\binom mk(x-y)^{m-k}\frac{A_{n+k+1}(y)}{n+k+1} -\sum_{k=0}^n\binom{n}k(y-x)^{n-k}\frac{A_{m+k+1}(x)}{m+k+1} \\=(-1)^m\frac{m!n!}{(m+n+1)!}a_0(y-x)^{m+n+1}. \end{multlined}\tag \(\star\) \] There are several different extensions of the fundamental identities \((*)\) and \((\star)\), see, e.g., \textit{R. Chapman} [An infinite family of dual sequence identities. Integers 5, No. 1, Paper A31 (2005; Zbl 1134.11308)], \textit{K.-W. Chen} [J. Number Theory 124, 142--150 (2007; Zbl 1120.05007)], and \textit{S. J. X. Hou} and \textit{J. Zeng} [Eur. J. Comb. 28, 214--227 (2007; Zbl 1107.05011)]. In the paper under review, the authors define \[ \Omega_{m,n,l}(x,y)=\sum_{k=0}^m\binom mk\frac{A_{n+k+l}(x)}{(n+k+1)_l}(y-x)^{m-k}, \] where \[ (c)_l=\begin{cases} c(c+1)\cdots(c+l-1)&\text{if }\;l>0,\\ 1&\text{if }\;l=0,\\ 1/((c-1)\cdots(c+l))&\text{if }\;l<0.\end{cases} \] Then, they generalize the reviewer's identities \((*)\) and \((\star\)) in the following way: If \(l\leq0\) then \(\Omega_{m,n,l}(x,y)=\Omega_{n,m,l}(y,x)\); if \(l>0\) then \(\Omega_{m,n,l}(x,y)-\Omega_{n,m,l}(y,x)\) equals \[ \frac{(-1)^m m!n!}{(m+n+l)!} \sum_{k=1}^l\binom{m+n+l}{l-k} \binom{m+k-1}m A_{l-k}(y) (x-y)^{m+n+k}. \] In the case \(l\leq0\) this result is equivalent to the authors' Corollary 2 which has the same flavor with Lemma 3.1 of t…
Mathematics Subject Classification ID: 05A19
Mathematics Subject Classification ID: 11B39
Mathematics Subject Classification ID: 11B68
zbMATH DE Number: 5137597
zbMATH Keywords: combinatorial identity
zbMATH Keywords: symmetric relation
zbMATH Keywords: reciprocal sequence
reviewed by: Zhi-Wei Sun
MaRDI profile type: Publication
full work available at URL: j.ejc.2005.10.012
OpenAlex ID: W1995271972
cites work: Q4760447
cites work: Q4769056
cites work: Applications of the classical umbral calculus
cites work: Q4040797
cites work: A recurrence formula for the Bernoulli numbers
cites work: Invariant sequences under binomial transformation
cites work: Combinatorial identities in dual sequences
cites work: Q4324964
cites work: Q4663908
cites work: Q4526417
DOI: 10.1016/J.EJC.2005.10.012
Recommended article: Q5889277
Recommended article: Q4340266
Recommended article: On summation formulas
Recommended article: “Sobre as Somas das Séries de Recíprocos”, de L. Euler
Recommended article: Reduction formulas for the summation of reciprocals in certain second-order recurring sequences
Recommended article: On some summation formulas
Recommended article: On Certain Reciprocal Sums
Recommended article: On the reciprocal sums of higher-order sequences
Recommended article: Q4760590
description: scientific article; zbMATH DE number 5137597