Generalized Schröder matrices arising from enumeration of lattice paths
From MaRDI portal
Publication:3297028
DOI10.21136/CMJ.2019.0348-18MaRDI QIDQ3297028
No author found.
Publication date: 2 July 2020
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Matrix equations and identities (15A24) Special sequences and polynomials (11B83)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorics of Riordan arrays with identical \(A\) and \(Z\) sequences
- Counting lattice paths with four types of steps
- Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern
- Identities induced by Riordan arrays
- Skew Dyck paths
- A history and a survey of lattice path enumeration
- The Riordan group
- Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
- Bijective recurrences concerning Schröder paths
- Riordan arrays and combinatorial sums
- Half of a Riordan array and restricted lattice paths
- Parametric Catalan numbers and Catalan triangles
- Total positivity of Riordan arrays
- Some matrix identities on colored Motzkin paths
- Enumeration via ballot numbers
- Schröder matrix as inverse of Delannoy matrix
- Proper generating trees and their internal path length
- The generalized Schröder theory
- Inverses of Motzkin and Schr\"oder Paths
- Hipparchus, Plutarch, Schroder, and Hough
- On Some Alternative Characterizations of Riordan Arrays
- The on-line encyclopedia of integer sequences
- $(m,r)$-central Riordan arrays and their applications
- Generalized Schröder matrix and its combinatorial interpretation
- Motzkin numbers of higher rank: Generating function and explicit expression
- A bijective proof of the equation linking the Schröder numbers, large and small
