JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2015, Vol. 50 ›› Issue (04): 82-89.doi: 10.6040/j.issn.1671-9352.0.2014.196

Previous Articles     Next Articles

The Riordan group and symmetric lattice paths

DENG Li-hua1, DENG Yu-ping2, Louis W. Shapiro3   

  1. 1. School of Mathematics and Information Science, Henan Polytechnic University, Jiaozuo 454000, Henan, China;
    2. School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, Liaoning, China;
    3. Department of Mathematics, Howard University, Washington, DC 20059, USA
  • Received:2014-05-04 Revised:2014-11-17 Online:2015-04-20 Published:2015-04-17

Abstract: The symmetric lattice paths are studied. Let dn, mn, and sn denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schröder paths of length 2n, respectively. By using Riordan group methods, six identities relating dn, mn, and sn are obtained and also two of them combinatorial proofs are given. Finally, some relations satisfied by the generic element of some special Riordan arrays are investigated and the average mid-height and the average number of points on the x-axis of symmetric Dyck paths of length 2n are obtained.

Key words: Riordan group, combinatorial identities, symmetric Motzkin paths, symmetric Dyck paths, symmetric Schröder paths

CLC Number: 

  • O157.1
[1] CHEN W Y C, DENG E Y P, YANG L L M. Motzkin paths and reduced decompositions for permutations with forbidden patterns[J]. Electron J Combin, 2003, 9(2):1-13.
[2] DEUTSCH E, SHAPIRO L W. A bijection between ordered trees and 2-Motzkin paths and its many consequences[J]. Discrete Math, 2002, 256:655-670.
[3] STANLEY R P. Enumerative combinatorics: Vol.2[M]. Cambridge: Cambridge University Press, 1999.
[4] SLOANE N J A. The on-line encyclopedia of integer sequences[EB/OL]. (2003-12-24). http//
[5] ROGERS D G. Pascal triangles, catalan numbers and renewal arrays[J]. Discrete Math, 1978, 22(3):301-310.
[6] KETTLE S G. Families enumerated by the Schrder-Etherington sequence and a renewal array it generates[M]// Lecture Notes in Math: Vol 1036. Berlin: Springer, 1983:244-274.
[7] SHAPIRO L W, GETU S, WOAN W J, et al. The riordan group[J]. Discrete Appl Math, 1991, 34(1-3):229-239.
[8] SPRUGNOLI R. Riordan arrays and the Abel-Gould identity[J]. Discrete Math, 1995, 142(1-3):213-233.
[9] DENG Eva Y P, YAN Weijun. Some identities on the Catalan, Motzkin, and Schroder numbers[J]. Discrete Appl Math, 2008, 156:2781-2789.
[10] DERSHOWITZ N, ZAKS S. Enumerations of ordered trees[J]. Discrete Math, 1980, 31:9-28.
[1] CAO Ya-meng, LI Jiao, LI Guo-quan. On sumsets and translates of vector subspaces over finite fields [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(4): 7-10.
[2] LI Fang, GUANG Ai-xia, LI Guo-quan. Sumsets and subsets of Bohr sets in finite abelian groups [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2017, 52(2): 39-43.
[3] LIU Jiang-bi, LUO Zhi-xue. Optimal control for a nonlinear diffusion system with age-dependent [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(5): 136-142.
[4] PANG Rong-bo. Counting formulate about partition with the largest part n [J]. J4, 2013, 48(12): 66-69.
[5] LI Zhi-rong and LI Ying-hui . A new kind of summation formulae involving the Genocchi number and Riemann Zeta function [J]. J4, 2007, 42(4): 79-83 .
[6] LI Zhi-rong . Computational formulae of generalized m-th-order Bell numbers and generalized m-order orderd Bell numbers [J]. J4, 2007, 42(2): 59-63 .
Full text



No Suggested Reading articles found!