On recursively defined combinatorial classes and labelled trees
Combinatorics
2020-04-14 v2 Information Theory
math.IT
Abstract
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
Cite
@article{arxiv.2004.04203,
title = {On recursively defined combinatorial classes and labelled trees},
author = {Ali Chouria and Vlad-Florin Drǎgoi and Jean-Gabriel Luque},
journal= {arXiv preprint arXiv:2004.04203},
year = {2020}
}
Comments
14 pages, 6 figures, accepted for presentation at the International Conference on Computers Communications and Control (ICCCC), May 2020