Uniform random generations and rejection method(I) with binomial majorant
Discrete Mathematics
2023-03-17 v1 Combinatorics
Abstract
We present three simple algorithms to uniformly generate `Fibonacci words' (i.e., some words that are enumerated by Fibonacci numbers), Schr{\"o}der trees of size and Motzkin left factors of size and final height . These algorithms have an average complexity of in the unit-cost RAM model.
Cite
@article{arxiv.2303.09338,
title = {Uniform random generations and rejection method(I) with binomial majorant},
author = {Laurent Alonso},
journal= {arXiv preprint arXiv:2303.09338},
year = {2023}
}