Patterns in treeshelves
Discrete Mathematics
2016-11-24 v1 Combinatorics
Abstract
We study the distribution and the popularity of left children on sets of treeshelves avoiding a pattern of size three. (Treeshelves are ordered binary increasing trees where every child is connected to its parent by a left or a right link.) The considered patterns are sub-treeshelves, and for each such a pattern we provide exponential generating function for the corresponding distribution and popularity. Finally, we present constructive bijections between treeshelves avoiding a pattern of size three and some classes of simpler combinatorial objects.
Cite
@article{arxiv.1611.07793,
title = {Patterns in treeshelves},
author = {Jean-Luc Baril and Sergey Kirgizov and Vincent Vajnovszki},
journal= {arXiv preprint arXiv:1611.07793},
year = {2016}
}