Algorithms for enumeration of lattice paths with constraints and root trees by various parameters

A. A. Balagura, O. V. Kuz'min

Irkutsk State University

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: tree, plane trees, lattice path, enumeration algorithm

UDC: 519.1

MSC: 06A06, 05C05, 05C31, 05E05

DOI: 10.36535/2782-4438-2025-238-24-35

 English version: Journal of Mathematical Sciences (New York), 2025, 291:3, 357–368