Algorithms for Enumeration of Lattice Paths with Constraints and Rooted Trees by Various Parameters

Approaches to enumerating various types of objects are demonstrated: with restrictions, labeled, and unlabeled. An algorithmic scheme for constructing geometric interpretations of families of combinatorial numbers has been developed. The issues of enumerating planar and nonplanar trees according to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical sciences (New York, N.Y.) Jg. 291; H. 3; S. 357 - 368
Hauptverfasser: Balagura, A. A., Kuzmin, O. V.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Cham Springer International Publishing 01.06.2025
Springer Nature B.V
Schlagworte:
Algorithms
Combinatorial analysis
Enumeration
Mathematics
Mathematics and Statistics
Parameters
05C31
enumeration algorithm
planar trees
lattice path
tree
05E05
06A06
05C05
ISSN:1072-3374, 1573-8795
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Approaches to enumerating various types of objects are demonstrated: with restrictions, labeled, and unlabeled. An algorithmic scheme for constructing geometric interpretations of families of combinatorial numbers has been developed. The issues of enumerating planar and nonplanar trees according to various parameters are considered.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1072-3374
1573-8795
DOI:10.1007/s10958-025-07816-y