The statistic "number of udu's" in Dyck paths

Discrete Mathematics

Volumn 287, Issue 1-3, 2004, Pages 177-186

  Sun, Yidong ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

Dyck paths; Identities; Motzkin numbers

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING;

DYCK PATHS; IDENTITIES; MOTZKIN NUMBERS;

NUMBER THEORY;

EID: 4644241166     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2004.07.002     Document Type: Article

References (22)

1. E. Barcucci, R. Pinzani, R. Sprugnoli, The Motzkin family, PU. M. A. Ser. A 2 (1991) 249-279.
2. E. Deutsch, Dyck path enumeration, Discrete Math. 204 (1999) 167-202.
3. E. Deutsch, L.W. Shapiro, A survey of the fine numbers, Discrete Math. 241 (2001) 241-265.
4. E. Deutsch, L.W. Shapiro, A bijection between ordered trees and 2-Motzkin paths and its many consequences, Discrete Math. 256 (2002) 665-670.
5. R. Donaghey, L.W. Shapiro, Motzkin numbers, J. Combin. Theory Ser. A 23 (1977) 291-301.
6. G.P. Egorychev, Integral Representation and the Computation of Combinatorial Sums, Translations of Mathematical Monographs, vol. 59, Amer. Math. Soc., Providence, RI, 1984.
7. I.P. Goulden, D.M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
8. D. Gouyou-Beauchamps, G. Viennot, Equivalence of the two-dimensional directed animal problem to a one-dimensional path problem, Adv. Appl. Math. 9 (1988) 334-357.
9. G. Kreweras, Joint distribution of three descriptive parameters of bridges, Combinatoire énumérative, Proceedings (Montreal, Que., 1985/Quebec, Que., 1985), Lecture Notes in Mathematics, vol. 1234, Springer, Berlin, 1986, pp. 177-191.
10. G. Kreweras, P. Moszkowski, A new enumerative property of the Narayana numbers, J. Statist. Plann. Inference 14 (1986) 63-67.
11. G. Kreweras, Y. Poupard, Subdivision des Nombres de Narayana Suivant deux Paramètres Supplémentaires, European J. Combin. 7 (1986) 141-149.
12. D. Merlini, D.G. Rogers, R. Sprugnoli, M.C. Verri, On some alternative characterizations of Riordan arrays, Canad. J. Math. 49 (2) (1997) 301-320.
13. D. Merlini, R. Sprugnoli, M.C. Verri, Some statistics on Dyck paths, J. Statist. Plann. Inference 101 (2002) 211-227.
14. A. Panayotopoulos, A. Sapounakis, On the prime decomposition of Dyck words, J. Combin. Math. Combin. Comput. 40 (2002) 33-39.
15. F.J. Papp, Another proof of Tepper's inequality, Math. Mag. 45 (1972) 119-121.
16. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
17. J.M. Sen, Two special arrangement counting problems and a combinatorial identity, Combin. and Graph Theory, Heifei (1992) 31-39.
18. R. Sprugnoli, Riordan arrays and combinatorial sums, Discrete Math. 132 (1994) 267-290.
19. R.P. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999.
20. Y. Sun, Identities involving some numbers related to Dyck paths, submitted.
21. Y. Sun, Numerical triangles and several classical sequences, The Fibonacci Quarterly, to appear.
22. D. Zeilberger, Six études in generating functions, Internat. J. Comp. Math. 29 (1989) 201-215.