Holonomic equations and efficient random generation of binary trees

Lescanne, Pierre

Discrete mathematics & theoretical computer science, Tome 25 (2023-2024) no. 2.

Résumé

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 and show that despite slight differences my algorithm that generates random Schröder trees has linear expected complexity and my algorithm that generates Motzkin trees is in O(n) expected complexity, only if we can implement a specific oracle with a O(1) complexity. For Motzkin trees, I propose a solution which works well for realistic values (up to size ten millions) and yields an efficient algorithm.

Détail

DOI : 10.46298/dmtcs.10952

Classification : 05C05