Generating trees and proper Riordan arrays
From MaRDI portal
Publication:1978153
DOI10.1016/S0012-365X(99)00343-XzbMath0949.05004OpenAlexW1963716616MaRDI QIDQ1978153
Publication date: 3 December 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00343-x
Related Items (38)
Combinatorics of a generalized Narayana identity ⋮ From object grammars to ECO systems ⋮ Enumeration of bipartite non-crossing geometric graphs ⋮ Unnamed Item ⋮ Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type ⋮ \(q\)-Riordan representation ⋮ Binary words excluding a pattern and proper Riordan arrays ⋮ Half of a Riordan array and restricted lattice paths ⋮ New production matrices for geometric graphs ⋮ Parametric Catalan numbers and Catalan triangles ⋮ Mertens equimodular matrices of Redheffer type ⋮ Some new binomial sums related to the Catalan triangle ⋮ Characteristic polynomials of production matrices for geometric graphs ⋮ Left multiplication operators on the Riordan group ⋮ Riordan arrays and difference equations of subdiagonal lattice paths ⋮ Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences ⋮ Identities induced by Riordan arrays ⋮ Production matrices and riordan arrays ⋮ An identity of Andrews and a new method for the Riordan array proof of combinatorial identities ⋮ The Star of David rule ⋮ Ultrametrics, Banach's fixed point theorem and the Riordan group ⋮ Production matrices for geometric graphs ⋮ Proper generating trees and their internal path length ⋮ Mixed succession rules: the commutative case ⋮ The tennis ball problem ⋮ Waiting patterns for a printer ⋮ A history and a survey of lattice path enumeration ⋮ Production matrices ⋮ Riordan arrays and related polynomial sequences ⋮ Sequence characterization of 3-dimensional Riordan arrays and some application ⋮ Integral Representation and Algorithms for Closed Form Summation ⋮ Riordan arrays, Łukasiewicz paths and Narayana polynomials ⋮ New results on production matrices for geometric graphs ⋮ Some (counter)examples on totally positive Riordan arrays ⋮ The relevant prefixes of coloured Motzkin walks: an average case analysis ⋮ A new lower bound on the maximum number of plane graphs using production matrices ⋮ Representing polynomials as characteristic polynomials via the Stieltjes transform ⋮ A linear operator approach to succession rules
This page was built for publication: Generating trees and proper Riordan arrays
