Generating trees and proper Riordan arrays
From MaRDI portal
Publication:1978153
DOI10.1016/S0012-365X(99)00343-XzbMATH Open0949.05004OpenAlexW1963716616MaRDI QIDQ1978153FDOQ1978153
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
Recommendations
- Level generating trees and proper Riordan arrays
- Generating functions for generating trees
- Generating trees and the Catalan and Schröder numbers
- Recursive generation of \(k\)-ary trees
- Generating trees and forbidden subsequences
- Generating Regular k-ary Trees Efficiently
- Generating trees and pattern avoidance in alternating permutations
- scientific article; zbMATH DE number 3961006
- scientific article; zbMATH DE number 3974971
- Generating trees for permutations avoiding generalized patterns
Cited In (45)
- Representing polynomials as characteristic polynomials via the Stieltjes transform
- A linear operator approach to succession rules
- Mixed succession rules: the commutative case
- Some new binomial sums related to the Catalan triangle
- Generating ordered trees
- Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
- Combinatorics of a generalized Narayana identity
- Binary words excluding a pattern and proper Riordan arrays
- Identities induced by Riordan arrays
- On three-dimensional \(q\)-Riordan arrays
- Riordan arrays and related polynomial sequences
- Riordan arrays, Łukasiewicz paths and Narayana polynomials
- Generating trees and forbidden subsequences
- An identity of Andrews and a new method for the Riordan array proof of combinatorial identities
- Integral Representation and Algorithms for Closed Form Summation
- Production matrices
- The relevant prefixes of coloured Motzkin walks: an average case analysis
- A history and a survey of lattice path enumeration
- Generating functions for generating trees
- A new lower bound on the maximum number of plane graphs using production matrices
- Waiting patterns for a printer
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating t-ary trees in A-order
- Enumeration of bipartite non-crossing geometric graphs
- New production matrices for geometric graphs
- Title not available (Why is that?)
- Parametric Catalan numbers and Catalan triangles
- Decomposition and group theoretic characterization of pairs of inverse relations of the Riordan type
- Sequence characterization of 3-dimensional Riordan arrays and some application
- New results on production matrices for geometric graphs
- Proper generating trees and their internal path length
- From object grammars to ECO systems
- Riordan arrays and difference equations of subdiagonal lattice paths
- Half of a Riordan array and restricted lattice paths
- Left multiplication operators on the Riordan group
- Some (counter)examples on totally positive Riordan arrays
- Ultrametrics, Banach's fixed point theorem and the Riordan group
- Mertens equimodular matrices of Redheffer type
- Characteristic polynomials of production matrices for geometric graphs
- Production matrices and riordan arrays
- The tennis ball problem
- Production matrices for geometric graphs
- \(q\)-Riordan representation
- The Star of David rule
This page was built for publication: Generating trees and proper Riordan arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978153)
