Patterns in treeshelves - Université de Bourgogne Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics Année : 2017

Patterns in treeshelves


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.

Dates et versions

hal-01588383 , version 1 (15-09-2017)



Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki. Patterns in treeshelves. Discrete Mathematics, 2017, 340 (12), pp.2946 - 2954. ⟨10.1016/j.disc.2017.07.021⟩. ⟨hal-01588383⟩
53 Consultations
0 Téléchargements



Gmail Facebook X LinkedIn More