Binomial transform
≈ 10 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In combinatorics, the binomial transform is a sequence transformation (i.e., a transform of a sequence) that computes its forward differences. It is closely related to the Euler transform, which is the result of applying the binomial transform to the sequence associated with its ordinary generating function.
Definition
edit edit sourceThe binomial transform, T, of a sequence, {an}, is the sequence {sn} defined by
sn=∑k=0n(−1)k(nk)ak.
Formally, one may write
sn=(Ta)n=∑k=0nTnkak
for the transformation, where T is an infinite-dimensional operator with matrix elements Tnk. The transform is an involution, that is,
TT=1
or, using index notation,
∑k=0∞TnkTkm=δnm
where δnm is the Kronecker delta. The original series can be regained by
an=∑k=0n(−1)k(nk)sk.
The binomial transform of a sequence is just the n-th forward differences of the sequence, with odd differences carrying a negative sign, namely:
s0=a0s1=−(Δa)0=−a1+a0s2=(Δ2a)0=−(−a2+a1)+(−a1+a0)=a2−2a1+a0⋮sn=(−1)n(Δna)0
where Δ is the forward difference operator.
Some authors define the binomial transform with an extra sign, so that it is not self-inverse:
tn=∑k=0n(−1)n−k(nk)ak
whose inverse is
an=∑k=0n(nk)tk.
In this case the former transform is called the inverse binomial transform, and the latter is just binomial transform. This is standard usage for example in On-Line Encyclopedia of Integer Sequences.
Example
edit edit sourceBoth versions of the binomial transform appear in difference tables. Consider the following difference table:
| 0 | 1 | 10 | 63 | 324 | 1485 | |||||
| 1 | 9 | 53 | 261 | 1161 | ||||||
| 8 | 44 | 208 | 900 | |||||||
| 36 | 164 | 692 | ||||||||
| 128 | 528 | |||||||||
| 400 |
Each line is the difference of the previous line. (The n-th number in the m-th line is am,n = 3n−2(2m+1n2 + 2m(1+6m)n + 2m-19m2), and the difference equation am+1,n = am,n+1 - am,n holds.)
The top line read from left to right is {an} = 0, 1, 10, 63, 324, 1485, ... The diagonal with the same starting point 0 is {tn} = 0, 1, 8, 36, 128, 400, ... {tn} is the noninvolutive binomial transform of {an}.
The top line read from right to left is {bn} = 1485, 324, 63, 10, 1, 0, ... The cross-diagonal with the same starting point 1485 is {sn} = 1485, 1161, 900, 692, 528, 400, ... {sn} is the involutive binomial transform of {bn}.
Ordinary generating function
edit edit sourceThe transform connects the generating functions associated with the series. For the ordinary generating function, let
f(x)=∑n=0∞anxn
and
g(x)=∑n=0∞snxn
then
g(x)=(Tf)(x)=11−xf(−x1−x).
Euler transform
edit edit sourceThe relationship between the ordinary generating functions is sometimes called the Euler transform. It commonly makes its appearance in one of two different ways. In one form, it is used to accelerate the convergence of an alternating series. That is, one has the identity
∑n=0∞(−1)nan=∑n=0∞(−1)n(Δna)02n+1
which is obtained by substituting x = 1/2 into the last formula above. The terms on the right hand side typically become much smaller, much more rapidly, thus allowing rapid numerical summation.
The Euler transform can be generalized (Borisov B. and Shkodrov V., 2007):
∑n=0∞(−1)n(n+pn)an=∑n=0∞(−1)n(n+pn)(Δna)02n+p+1,
where p = 0, 1, 2,....
The Euler transform is also frequently applied to the Euler hypergeometric integral 2F1. Here, the Euler transform takes the form:
2F1(a,b;c;z)=(1−z)−b2F1(c−a,b;c;zz−1).
[See [1] for generalizations to other hypergeometric series.]
The binomial transform, and its variation as the Euler transform, is notable for its connection to the continued fraction representation of a number. Let 0<x<1 have the continued fraction representation
x=[0;a1,a2,a3,⋯]
then
x1−x=[0;a1−1,a2,a3,⋯]
and
x1+x=[0;a1+1,a2,a3,⋯].
Exponential generating function
edit edit sourceFor the exponential generating function, let
f‾(x)=∑n=0∞anxnn!
and
g‾(x)=∑n=0∞snxnn!
then
g‾(x)=(Tf‾)(x)=exf‾(−x).
The Borel transform will convert the ordinary generating function to the exponential generating function.
Binomial convolution
edit edit sourceLet (an)n∈ℕ and (bn)n∈ℕ be sequences of complex numbers. Their binomial convolution is defined by (a∘b)n=∑k=0n(nk)akbn−k, n=0,1,2,… This convolution can be found in the book by R.L. Graham, D.E. Knuth and O. Patashnik: Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley (1989). It is easy to see that the binomial convolution is associative and commutative, and the sequence {en} defined by e0=1 and en=0 for n=1,2,…, serves as the identity under the binomial convolution. Further, it is easy to see that the sequences {an} with a0≠0 possess an inverse. Thus the set of sequences {an} with a0≠0 forms an abelian group under the binomial convolution.
The binomial convolution arises naturally from the product of the exponential generating functions. In fact, (∑n=0∞anxnn!)(∑n=0∞bnxnn!)=∑n=0∞(a∘b)nxnn!.
The binomial transform can be written in terms of binomial convolution. Let λn=(−1)n and 1n=1 for all n. Then (Ta)n=(λa∘1)n. The formula tn=∑k=0n(−1)n−k(nk)ak⟺an=∑k=0n(nk)tk can be interpreted as a Möbius inversion type formula tn=(a∘λ)n⟺an=(t∘1)n since λn is the inverse of 1n under the binomial convolution.
There is also another binomial convolution in the mathematical literature. The binomial convolution of arithmetical functions f and g is defined as (f∘Bg)(n)=∑d∣n(∏p(νp(n)νp(d)))f(d)g(n/d), where n=∏ppνp(n) is the canonical factorization of a positive integer n and (νp(n)νp(d)) is the binomial coefficient. This convolution appears in the book by P. J. McCarthy (1986) and was further studied by L. Toth and P. Haukkanen (2009).
Integral representation
edit edit sourceWhen the sequence can be interpolated by a complex analytic function, then the binomial transform of the sequence can be represented by means of a Nörlund–Rice integral on the interpolating function.
Generalizations
edit edit sourceProdinger gives a related, modular-like transformation: letting
un=∑k=0n(nk)ak(−c)n−kbk
gives
U(x)=1cx+1B(axcx+1)
where U and B are the ordinary generating functions associated with the series {un} and {bn}, respectively.
The rising k-binomial transform is sometimes defined as
∑j=0n(nj)jkaj.
The falling k-binomial transform is
∑j=0n(nj)jn−kaj.
Both are homomorphisms of the kernel of the Hankel transform of a series.
In the case where the binomial transform is defined as
∑i=0n(−1)n−i(ni)ai=bn.
Let this be equal to the function 𝔍(a)n=bn.
If a new forward difference table is made and the first elements from each row of this table are taken to form a new sequence {bn}, then the second binomial transform of the original sequence is,
𝔍2(a)n=∑i=0n(−2)n−i(ni)ai.
If the same process is repeated k times, then it follows that,
𝔍k(a)n=bn=∑i=0n(−k)n−i(ni)ai.
Its inverse is,
𝔍−k(b)n=an=∑i=0nkn−i(ni)bi.
This can be generalized as,
𝔍k(a)n=bn=(𝐄−k)na0
where 𝐄 is the shift operator.
Its inverse is
𝔍−k(b)n=an=(𝐄+k)nb0.
See also
edit edit source- Newton series
- Hankel matrix
- Möbius transform
- Stirling transform
- Euler summation
- Binomial QMF
- Riemann–Liouville integral
- List of factorial and binomial topics
References
edit edit source- ^ Miller, Allen R.; Paris, R. B. (2010). "Euler-type transformations for the generalized hypergeometric function". Z. Angew. Math. Phys. 62 (1): 31–45. doi:10.1007/s00033-010-0085-0. S2CID 30484300.
- John H. Conway and Richard K. Guy, 1996, The Book of Numbers
- Donald E. Knuth, The Art of Computer Programming Vol. 3, (1973) Addison-Wesley, Reading, MA.
- Helmut Prodinger, Some information about the binomial transform, The Fibonacci Quarterly 32 (1994), 412–415.
- Spivey, Michael Z.; Steil, Laura L. (2006). "The k-Binomial Transforms and the Hankel Transform". Journal of Integer Sequences. 9: 06.1.1. Bibcode:2006JIntS...9...11S.
- Borisov, B.; Shkodrov, V. (2007). "Divergent Series in the Generalized Binomial Transform". Adv. Stud. Cont. Math. 14 (1): 77–82.
- Khristo N. Boyadzhiev, Notes on the Binomial Transform, Theory and Table, with Appendix on the Stirling Transform (2018), World Scientific.
- R.L. Graham, D.E. Knuth and O. Patashnik: Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley (1989).
- P. J. McCarthy, Introduction to Arithmetical Functions, Springer-Verlag, 1986.
- P. Haukkanen, On a binomial convolution of arithmetical functions, Nieuw Arch. Wisk. (IV) 14 (1996), no. 2, 209--216.
- L. Toth and P. Haukkanen, On the binomial convolution of arithmetical functions, J. Combinatorics and Number Theory 1(2009), 31–48.
- P. Haukkanen, Some binomial inversions in terms of ordinary generating functions. Publ. Math. Debr. 47, No. 1-2, 181-191 (1995).
External links
edit edit source- Binomial Transform on Wolfram MathWorld
- Binomial transform in the OEIS wiki
Text derived from https://en.wikipedia.org/w/index.php?oldid=1370490321 under CC BY-SA 4.0; modifications have been made.