A Riordan array proof of
2002
Sign up for access to the world's latest research
Abstract
We give an alternative proof of an identity that appeared recently in Integers. By using the concept of Riordan arrays we obtain a short, elementary proof.
Related papers
2021
We define two notions of partial sums of a Riordan array, corresponding respectively to the partial sums of the rows and the partial sums of the columns of the Riordan array in question. We characterize the matrices that arise from these operations. On the one hand, we obtain a new Riordan array, while on the other hand, we obtain a rectangular array which has an inverse that is a lower Hessenberg matrix. We examine the structure of these Hessenberg matrices. We end with a generalization linked to the Fibonacci numbers and phyllotaxis.
Linear Algebra and its Applications, 2013
We approach Riordan arrays and their generalizations via umbral symbolic methods. This new approach allows us to derive fundamental aspects of the theory of Riordan arrays as immediate consequences of the umbral version of the classical Abel's identity for polynomials. In particular, we obtain a novel non-recursive formula for Riordan arrays and derive, from this new formula, some known recurrences and a new recurrence relation for Riordan arrays.
arXiv: Combinatorics, 2019
For a lower triangular matrix $(t_{n,k})$ we call the matrices with respective entries $(t_{2n-k,n})$ and $(t_{2n,n+k})$ the vertical and the horizontal halves. In this note, we discuss Riordan arrays whose halves are closely related to the Catalan matrices.
Linear Algebra and its Applications
Every Riordan array has what we call a horizontal half and a vertical half. These halves of a Riordan array have been studied separately before. Here, we place them in a common context, showing that one may be obtained from the other. Using them, we provide a canonical factorization of elements of the associated or Lagrange subgroup of the Riordan group. The vertical half matrix is shown to be an element of the hittingtime group. We also ask and answer the question: given a Riordan array, when is it the half (either horizontal of vertical) of a Riordan array?
Discrete Mathematics, 2009
In this paper we present the theory of implicit Riordan arrays, that is, Riordan arrays which require the application of the Lagrange Inversion Formula to be dealt with. We show several examples in which our approach gives explicit results, both in finding closed expressions for sums and, especially, in solving classes of combinatorial sum inversions.
2020
We provide an alternative description of the group of Riordan arrays, by using two power series of the form $\sum_{n=0}^{\infty} g_n x^n$, where $g_0 \ne 0$ to build a typical element of the constructed group. We relate these elements to Riordan arrays in the usual description, showing that each newly constructed element is the vertical half of a "usual" element. The product rules and the construction of the inverse are given in this new description, which we call a "central" description, because of links to the central coefficients of Riordan arrays. This is done for the case of ordinary generating functions. Finally, we briefly look at the exponential case.
Special Matrices, 2021
In this paper, by means of the summation property to the Riordan array, we derive some identities involving generalized harmonic, hyperharmonic and special numbers. For example, for n ≥ 0, ∑ k = 0 n B k k ! H ( n . k , α ) = α H ( n + 1 , 1 , α ) - H ( n , 1 , α ) , \sum\limits_{k = 0}^n {{{{B_k}} \over {k!}}H\left( {n.k,\alpha } \right) = \alpha H\left( {n + 1,1,\alpha } \right) - H\left( {n,1,\alpha } \right)} , and for n > r ≥ 0, ∑ k = r n - 1 ( - 1 ) k s ( k , r ) r ! α k k ! H n - k ( α ) = ( - 1 ) r H ( n , r , α ) , \sum\limits_{k = r}^{n - 1} {{{\left( { - 1} \right)}^k}{{s\left( {k,r} \right)r!} \over {{\alpha ^k}k!}}{H_{n - k}}\left( \alpha \right) = {{\left( { - 1} \right)}^r}H\left( {n,r,\alpha } \right)} , where Bernoulli numbers Bn and Stirling numbers of the first kind s (n, r).
2021
Many Riordan arrays play a significant role in algebraic combinatorics. We explore the inversion of Riordan arrays in this context. We give a general construct for the inversion of a Riordan array, and study this in the case of various subgroups of the Riordan group. For instance, we show that the inversion of an ordinary Bell matrix is an exponential Riordan array in the associated subgroup. Examples from combinatorics and algebraic combinatorics illustrate the usefulness of such inversions. We end with a brief look at the inversion of exponential Riordan arrays. A final example places Airey’s convergent factor in the context of a simple exponential Riordan array.
Journal of the Institute of Engineering
We employ Stirling numbers of the second kind to prove a relation of Riordan involving harmonic numbers.
Journal of Integer Sequences, 2010
We determine which (ordinary) Riordan arrays are the coefficient arrays of a family of orthogonal polynomials. In so doing, we are led to introduce a family of polynomials, which includes the Boubaker polynomials, and a scaled version of the Chebyshev poynomials, using the techniques of Riordan arrays. We classify these polynomials in terms of the Chebyshev polynomials of the first and second kinds. We also examine the Hankel transforms of sequences associated to the inverse of the polynomial coefficient arrays, including the associated moment sequences.

Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
References (5)
- I. P. Goulden and D. M. Jackson. Combinatorial Enumeration. John Wiley & S., 1983.
- R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison- Wesley, 1989.
- A. Panholzer and H. Prodinger. A generating functions proof of a curious identity. Integers: The Electronic Journal of Combinatorial Number Theory, 2:A6, 3 pp., 2002.
- R. Sprugnoli. Riordan arrays and combinatorial sums. Discrete Mathematics, 132:267-290, 1994.
- Z.-W. Sun. A curious identity involving binomial coefficients. Integers: The Electronic Journal of Combinatorial Number Theory, 2:A4, 8 pp., 2002.