Affiliation:
1. Laboratory of Algorithms and Technologies for Discrete Structures Research, Tomsk State University of Control Systems and Radioelectronics, 634050 Tomsk, Russia
Abstract
Graphs are a powerful tool for solving various mathematical problems. One such task is the representation of discrete structures. Combinatorial generation methods make it possible to obtain algorithms that can create discrete structures with specified properties. This article is devoted to issues related to the construction of such combinatorial generation algorithms for a wide class of directed lattice paths. The main method used is based on the representation of a given combinatorial set in the form of an AND/OR tree structure. To apply this method, it is necessary to have an expression for the cardinality function of a combinatorial set that satisfies certain requirements. As the main result, we have found recurrence relations for enumerating simple directed lattice paths that satisfy the requirements of the applied method and have constructed the corresponding AND/OR tree structure. Applying the constructed AND/OR tree structure, we have developed new algorithms for ranking and unranking simple directed lattice paths. Additionally, the obtained results were generalized to the case of directed lattice paths.
Funder
Russian Science Foundation
Reference39 articles.
1. A history and a survey of lattice path enumeration;Humphreys;J. Statist. Plann. Inference,2010
2. Stanley, R.P. (2012). Enumerative Combinatorics: Volume 1, Cambridge University Press. [2nd ed.].
3. Bona, M. (2015). Handbook of Enumerative Combinatorics, CRC Press.
4. Wallner, M. (2016). Combinatorics of Lattice Paths and Tree-Like Structures. [Ph.D. Thesis, Institute of Discrete Mathematics and Geometry, Vienna University of Technology].
5. Dyck path enumeration;Deutsch;Discret. Math.,1999