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 trees...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete mathematics and theoretical computer science Vol. 25:2; no. 2; pp. 1 - 27
Main Author:	Lescanne, Pierre
Format:	Journal Article
Language:	English
Published:	Nancy DMTCS 01.01.2023 Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-cc]computer science [cs]/computational complexity [cs.cc] [info.info-ds]computer science [cs]/data structures and algorithms [cs.ds] Algorithms binary tree catalan number combinatorics combinatorics random generation motzkin number catalan number binary tree unary-binary tree Complexity Computational Complexity Computer Science Data Structures and Algorithms Mathematical analysis motzkin number random generation schroeder number unary-binary tree unary-binary tree binary tree random generation Schroeder number Motzkin number Catalan number combinatorics random generation Motzkin number Catalan number binary tree unary-binary tree combinatorics
ISSN:	1365-8050, 1462-7264, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!