Holonomic equations and efficient random generation of binary trees

Holonomic equations and efficient random generation of binary trees

Holonomic equations are recursive equations which allow computing efficiently numbers of combinatoric objects. Rémy showed that the holonomic equation associated with binary trees yields an efficient linear random generator of binary trees. I extend this paradigm to Motzkin trees and Schröder tree...

Full description

Bibliographic Details
Main Author: Pierre Lescanne
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2024-02-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
combinatorics
random generation
motzkin number
catalan number
binary tree
unary-binary tree
schroeder number
combinatorics random generation motzkin number catalan number binary tree unary-binary tree
[info.info-cc]computer science [cs]/computational complexity [cs.cc]
[info.info-ds]computer science [cs]/data structures and algorithms [cs.ds]
Online Access:https://dmtcs.episciences.org/10952/pdf

Internet

https://dmtcs.episciences.org/10952/pdf

Similar Items