Parametric Catalan numbers and Catalan triangles
DOI10.1016/j.laa.2012.10.001zbMath1257.05003OpenAlexW2017381362MaRDI QIDQ1931755
Publication date: 16 January 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.10.001
Catalan numberMotzkin numbersRiordan arraycharacteristic sequencelarge Schröder numbersBell-type Riordan arrayCatalan triangleslarge generalized Catalan numbersMotzkin triuanglessmall generalized Catalan numberssmall Schröder numbers
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) (q)-calculus and related topics (05A30) Permutations, words, matrices (05A05) Matrices of integers (15B36)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
- Riordan arrays associated with Laurent series and generalized Sheffer-type groups
- An algebraic structure for Faber polynomials
- Sequence characterization of Riordan arrays
- The Riordan group
- The number of Baxter permutations
- Pascal triangles, Catalan numbers and renewal arrays
- Riordan arrays and combinatorial sums
- A classic proof of a recurrence for a very classical sequence
- Enumerating a class of lattice paths
- Permutations, parenthesis words, and Schröder numbers
- Taylor expansions for Catalan and Motzkin numbers
- Bijections and the Riordan group
- Riordan arrays and the Abel-Gould identity
- Generating trees and the Catalan and Schröder numbers
- A divisibility property for a subgroup of Riordan matrices
- Generating trees and proper Riordan arrays
- The Sheffer group and the Riordan group
- Riordan group involutions
- Hipparchus, Plutarch, Schroder, and Hough
- On Some Alternative Characterizations of Riordan Arrays
- ECO:a methodology for the enumeration of combinatorial objects
- Some open questions about random walks, involutions, limiting distributions, and generating functions