Abstract
In this paper, we give a bijective proof of an identity on lattice paths with four types of steps in answer to a problem posed by Dziemiańczuk. Moreover, we prove a bijective relationship between the number of positive lattice paths and \(m\)-flawed lattice paths.
Similar content being viewed by others
References
Banderier, C., Schwer, S.: Why Delannoy numbers. J. Stat. Plan. Infer. 135, 40–54 (2005)
Chung, K.L., Feller, W.: On uctuations in coin-tossing. Proc. Natl. Acad. Sci. USA 35, 605–608 (1949)
Deutsch, E.: Dyck path enumeration. Discrete Math. 204, 167–202 (1999)
Donaghey, R., Shapiro, L.W.: Motzkin numbers. J. Combin. Theory Ser. A 23, 291–301 (1977)
Dziemiańczuk, M.: Counting lattice paths with four types of steps. Graphs Combin. doi:10.1007/s00373-013-1357-1
Eu, S.-P., Fu, T.-S., Yeh, Y.-N.: Refned Chung–Feller theorems for lattice paths. J. Combin. Theory Ser. A 112, 143–162 (2005)
Acknowledgments
The authors are very grateful to the referee for their comments and suggestions which helped to improve the presentation of the paper. This work was supported by the National Natural Science Foundation of China and ZJNSF (No. Y14A010029).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yan, S.H.F., Zhang, Y. On Lattice Paths with Four Types of Steps. Graphs and Combinatorics 31, 1077–1084 (2015). https://doi.org/10.1007/s00373-014-1424-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-014-1424-2