Enumerating a class of lattice paths

Discrete Mathematics

Volumn 271, Issue 1-3, 2003, Pages 13-28

  Coker, Curtis ^a  

^a GONZAGA UNIVERSITY   (United States)

Author keywords

Lagrange inversion formula; Lattice path; Narayana number

Indexed keywords

ALGORITHMS; LAGRANGE MULTIPLIERS; SET THEORY; THEOREM PROVING;

LATTICE PATHS;

INTEGER PROGRAMMING;

EID: 0042389577     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(03)00037-2     Document Type: Article

References (19)

1. Bonin J., Shapiro L., Simion R. Some. q -analogues of the Schröder numbers arising from combinatorial statistics on lattice paths J. Statist. Plann. Inference. 34:1993;35-55.
2. Comtet L. Advanced Combinatorics. 1974;D. Reidel, Dordrecht.
3. Denise A., Simion R. Two combinatorial statistics on Dyck paths. Discrete Math. 137:1995;155-176.
4. Flajolet P., Noy M. Analytic combinatorics of non-crossing configurations. Discrete Math. 204:1999;203-229.
5. Françon J., Viennot G. Permutations selon leurs pics, creux, doubles montées et doubles descentes, nombres d'Euler et nombres de Genocchi. Discrete Math. 28:1979;21-35.
6. Gessel I. A factorization of formal Laurent series and lattice path enumeration. J. Combin. Theory (A). 28:1980;321-337.
7. Gouyou-Beauchamps D., Vauquelin B. Deux propriétés combinatoires des nombres de Schröder. Theor. Inform. Appl. 22:1988;361-388.
8. Narayana T.V. A partial order and its application to probability theory. Sankhyā Ser. 21:1959;91-98.
9. Rogers D.G. Rhyming schemes. crossings and coverings Discrete Math. 33:1981;67-77.
10. D.G. Rogers, L.W. Shapiro, Deques, trees and lattice paths, in: Combinatorial Math. VIII: Proceedings of the Eighth Australian Conference on Combinatorial Mathematics, Lecture Notes in Mathematics, Vol. 884, Springer, Berlin, 1981, pp. 293-303.
11. Schmitt W.R., Waterman M.S. Linear trees and RNA secondary structure. Discrete Appl. Math. 51:1994;317-323.
12. Sedgewick R., Flajolet P. An Introduction to the Analysis of Algorithms. 1996;Addison-Wesley, Reading, MA.
13. Simion R., Ullman D. On the structure of the lattice of noncrossing partitions. Discrete Math. 98:1991;193-206.
14. R.P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, New York, 1999.
15. Sulanke R. Three recurrences for parallelogram polyominoes. J. Differential Equations Appl. 5:1999;155-176.
16. Sulanke R. Counting lattice paths by Narayana polynomials. Electron. J. Combin. 7:2000;#R40.
17. J. Touchard, Sur certaines équations fonctionnelles, in: Proceedings of the International Congress on Mathematics, University of Toronto Press, Toronto, 1928, pp. 465-472.
18. Woan Wen-jin Diagonal lattice paths, Proceedings of Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, LA, 2001. Congr. Numer. 151:2001;173-178.
19. Wen-jin Woan, sequence A059231, in: N.J.A. Sloane, On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/̃njas/sequences.