Abstract
We introduce a new family of generalized Schröder matrices from the Riordan arrays which are obtained by counting of the weighted lattice paths with steps E = (1, 0), D = (1, 1), N = (0, 1), and D′ = (1, 2) and not going above the line y = x. We also consider the half of the generalized Delannoy matrix which is derived from the enumeration of these lattice paths with no restrictions. Correlations between these matrices are considered. By way of illustration, we give several examples of Riordan arrays of combinatorial interest. In addition, we find some new interesting identities.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
M. Aigner: Enumeration via ballot numbers. Discrete Math. 308 (2008), 2544–2563.
P. Barry: On the central coefficients of Riordan matrices. J. Integer Seq. 16 (2013), Article 13.5.1, 12 pages.
J. Bonin, L. Shapiro, R. Simion: Some q-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths. J. Stat. Plann. Inference 34 (1993), 35–55.
X. Chen, H. Liang, Y. Wang: Total positivity of Riordan arrays. Eur. J. Comb. 46 (2015), 68–74.
G.-S. Cheon, H. Kim, L. W. Shapiro: Combinatorics of Riordan arrays with identical A and Z sequences. Discrete Math. 312 (2012), 2040–2049.
L. Comtet: Advanced Combinatorics: The Art of Finite and Infinite Expansions. D. Reidel Publishing, Dordrecht, 1974.
E. Deutsch: A bijective proof of the equation linking the Schröder numbers, large and small. Discrete Math. 241 (2001), 235–240.
E. Deutsch, E. Munarini, S. Rinaldi: Skew Dyck paths. J. Stat. Plann. Inference 140 (2010), 2191–2203.
M. Dziemiańczuk: Counting lattice paths with four types of steps. Graphs Comb. 30 (2014), 1427–1452.
T.-X. He: Parametric Catalan numbers and Catalan triangles. Linear Algebra Appl. 438 (2013), 1467–1484.
K. Humphreys: A history and a survey of lattice path enumeration. J. Stat. Plann. Inference 140 (2010), 2237–2254.
A. Luzón, D. Merlini, M. Morón, R. Sprugnoli: Identities induced by Riordan arrays. Linear Algebra Appl. 436 (2011), 631–647.
T. Mansour, M. Schork, Y. Sun: Motzkin numbers of higher ranks: Generating function and explicit expression. J. Integer Seq. 10 (2007), Article 07.7.4, 11 pages.
D. Merlini: Proper generating trees and their internal path length. Discrete Appl. Math. 156 (2008), 627–646.
D. Merlini, D. G. Rogers, R. Sprugnoli, M. C. Verri: On some alternative characterizations of Riordan arrays. Can. J. Math. 49 (1997), 301–320.
D. Merlini, R. Sprugnoli: Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern. Theor. Comput. Sci. 412 (2011), 2988–3001.
H. Niederhausen: Inverses of Motzkin and Schröder paths. Integers 12 (2012), Article ID A49, 19 pages.
A. Nkwanta, L. W. Shapiro: Pell walks and Riordan matrices. Fibonacci Q. 43 (2005), 170–180.
E. Pergola, R. A. Sulanke: Schröder triangles, paths, and parallelogram polyominoes. J. Integer Seq. 1 (1998), Article 98.1.7.
J. L. Ramírez, V. F. Sirvent: Generalized Schröder matrix and its combinatorial interpretation. Linear Multilinear Algebra 66 (2018), 418–433.
D. G. Rogers: A Schröder triangle: Three combinatorial problems. Combinatorial Mathematics, V. Lecture Notes in Mathematics 622, Springer, Berlin, 1977, pp. 175–196.
D. G. Rogers, L. W. Shapiro: Some correspondence involving the Schröder numbers and relations. Combinatorial Mathematics. Lecture Notes in Mathematics 686, Springer, Berlin, 1978.
E. Schröder: Vier kombinatorische probleme. Schloemilch Z. (Zs. f. Math. u. Phys.) 15 (1870), 361–376. (In German.)
L. W. Shapiro, S. Getu, W.-J. Woan, L. C. Woodson: The Riordan group. Discrete Appl. Math. 34 (1991), 229–239.
N. J. A. Sloane: On-line Encyclopedia of Integer Sequences (OEIS). Available at https://oeis.org (2018).
C. Song: The generalized Schröder theory. Electron. J. Comb. 12 (2005), Article ID 53, 10 pages.
R. Sprugnoli: Riordan arrays and combinatorial sums. Discrete Math. 132 (1994), 267–290.
R. P. Stanley: Hipparchus, Plutarch, Schröder, and Hough. Am. Math. Mon. 104 (1997), 344–350.
R. P. Stanley: Enumerative Combinatorics. Volume 2. Cambridge Studies in Advanced Mathematics 62, Cambridge University Press, Cambridge, 1999.
R. A. Sulanke: Bijective recurrences concerning Schröder paths. Electron. J. Combin. 5 (1998), Article ID R47, 11 pages.
W.-J. Woan: A relation between restricted and unrestricted weighted Motzkin paths. J. Integer Seq. 9 (2006), Article 06.1.7, 12 pages.
S.-L. Yang, Y.-N. Dong, T.-X. He: Some matrix identities on colored Motzkin paths. Discrete Math. 340 (2017), 3081–3091.
S.-L. Yang, Y.-N. Dong, L. Yang, J. Yin: Half of a Riordan array and restricted lattice paths. Linear Algebra Appl. 537 (2018), 1–11.
S.-L. Yang, Y.-X. Xu, T.-X. He: (m, r)-central Riordan arrays and their applications. Czech. Math. J. 67 (2017), 919–936.
S.-L. Yang, S.-N. Zheng, S.-P. Yuan, T.-X. He: Schröder matrix as inverse of Delannoy matrix. Linear Algebra Appl. 439 (2013), 3605–3614.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research has been supported by the National Natural Science Foundation of China (Grant No. 11561044, 11861045).
Rights and permissions
About this article
Cite this article
Yang, L., Yang, SL. & He, TX. Generalized Schröder Matrices Arising from Enumeration of Lattice Paths. Czech Math J 70, 411–433 (2020). https://doi.org/10.21136/CMJ.2019.0348-18
Received:
Published:
Issue Date:
DOI: https://doi.org/10.21136/CMJ.2019.0348-18