Algorithms for enumeration of lattice paths with constraints and root trees by various parameters
- Authors: Balagura A.A.1, Kuz'min O.V.1
-
Affiliations:
- Irkutsk State University
- Issue: Vol 238 (2025)
- Pages: 24-35
- Section: Articles
- URL: https://journal-vniispk.ru/2782-4438/article/view/312511
- DOI: https://doi.org/10.36535/2782-4438-2025-238-24-35
- ID: 312511
Cite item
Full Text
Abstract
Approaches to enumerating various types of objects are demonstrated: with restrictions, marked, and unmarked. An algorithmic scheme for constructing geometric interpretations of families of combinatorial numbers has been developed. The issues of enumerating flat and non-flat trees according to various parameters are considered.
Keywords
About the authors
Anna Aleksandrovna Balagura
Irkutsk State University
Oleg Viktorovich Kuz'min
Irkutsk State UniversityDoctor of physico-mathematical sciences, Professor
References
- Балагура А. А., Кузьмин О. В., “Перечислительные свойства комбинаторных полиномов”, Дискр. анал. исслед. опер., 18:1 (2011), 3–-14
- Кузьмин О. В., Обобщенные пирамиды Паскаля и их приложения, Наука, Новосибирск, 2000
- Платонов М. Л., Комбинаторные числа класса отображений и их приложения, Наука, М., 1979
- Balagura A. A., Kuzmin O. V., “Encoding and decoding algorithms for unlabeled trees”, J. Phys. Conf. Ser., 1847:1 (2021), 012027
- Balagura A. A., Kuzmin O. V., “Generalised Pascal pyramids and their reciprocals”, Discr. Math. Appl., 17:6 (2007), 619–628
- Kuzmin O. V., Balagura A. A., Kuzmina V. V., Khudonogov I. A., “Partially ordered sets and combinatory objects of the pyramidal structure”, Adv. Appl. Discr. Math., 20:2 (2019), 229–236
- Stanley R., Enumerated Combinatorics. Vol. 2, Cambridge Univ. Press, 2005
Supplementary files
