Pattern Avoidance in Generalized Non-crossing Trees
Combinatorics
2008-05-12 v1
Abstract
In this paper, the problem of pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding patterns of length one and two are obtained. Lagrange inversion formula is used to obtain the explicit formulas for some special cases. Bijection is also established between generalized non-crossing trees with special pattern avoidance and the little Schr\"{o}der paths.
Cite
@article{arxiv.0805.1280,
title = {Pattern Avoidance in Generalized Non-crossing Trees},
author = {Yidong Sun and Zhiping Wang},
journal= {arXiv preprint arXiv:0805.1280},
year = {2008}
}
Comments
12 pages; 3 figures