Geodesic
Algorithms for enumeration of lattice paths with constraints and root trees by various parameters
Itogi nauki i tehniki. Sovremennaâ matematika i eë priloženiâ. Tematičeskie obzory, Proceedings of the 6th International Conference "Dynamic Systems and Computer Science: Theory and Applications" (DYSC 2024). Irkutsk, September 16-20, 2024. Part 1, Tome 238 (2025), pp. 24-35.

Voir la notice de l'article provenant de la source Math-Net.Ru

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: tree, plane trees, lattice path, enumeration algorithm 
@article{INTO_2025_238_a1,
     author = {A. A. Balagura and O. V. Kuz'min},
     title = {Algorithms for enumeration of lattice paths with constraints and root trees by various parameters},
     journal = {Itogi nauki i tehniki. Sovremenna\^a matematika i e\"e prilo\v{z}eni\^a. Temati\v{c}eskie obzory},
     pages = {24--35},
     publisher = {mathdoc},
     volume = {238},
     year = {2025},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/INTO_2025_238_a1/}
}
TY  - JOUR
AU  - A. A. Balagura
AU  - O. V. Kuz'min
TI  - Algorithms for enumeration of lattice paths with constraints and root trees by various parameters
JO  - Itogi nauki i tehniki. Sovremennaâ matematika i eë priloženiâ. Tematičeskie obzory
PY  - 2025
SP  - 24
EP  - 35
VL  - 238
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/INTO_2025_238_a1/
LA  - ru
ID  - INTO_2025_238_a1
ER  - 
%0 Journal Article
%A A. A. Balagura
%A O. V. Kuz'min
%T Algorithms for enumeration of lattice paths with constraints and root trees by various parameters
%J Itogi nauki i tehniki. Sovremennaâ matematika i eë priloženiâ. Tematičeskie obzory
%D 2025
%P 24-35
%V 238
%I mathdoc
%U http://geodesic.mathdoc.fr/item/INTO_2025_238_a1/
%G ru
%F INTO_2025_238_a1
A. A. Balagura; O. V. Kuz'min. Algorithms for enumeration of lattice paths with constraints and root trees by various parameters. Itogi nauki i tehniki. Sovremennaâ matematika i eë priloženiâ. Tematičeskie obzory, Proceedings of the 6th International Conference "Dynamic Systems and Computer Science: Theory and Applications" (DYSC 2024). Irkutsk, September 16-20, 2024. Part 1, Tome 238 (2025), pp. 24-35. http://geodesic.mathdoc.fr/item/INTO_2025_238_a1/

[1] Balagura A. A., Kuzmin O. V., “Perechislitelnye svoistva kombinatornykh polinomov”, Diskr. anal. issled. oper., 18:1 (2011), 3–-14 | MR | Zbl

[2] Kuzmin O. V., Obobschennye piramidy Paskalya i ikh prilozheniya, Nauka, Novosibirsk, 2000 | MR

[3] Platonov M. L., Kombinatornye chisla klassa otobrazhenii i ikh prilozheniya, Nauka, M., 1979 | MR

[4] Balagura A. A., Kuzmin O. V., “Encoding and decoding algorithms for unlabeled trees”, J. Phys. Conf. Ser., 1847:1 (2021), 012027 | DOI

[5] Balagura A. A., Kuzmin O. V., “Generalised Pascal pyramids and their reciprocals”, Discr. Math. Appl., 17:6 (2007), 619–628 | MR | Zbl

[6] 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

[7] Stanley R., Enumerated Combinatorics. Vol. 2, Cambridge Univ. Press, 2005 | MR