Yidong Sun, Zhiping Wang
Published 2008-05-09Version 1
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.
Comments: 12 pages; 3 figures
Cyclic permutations avoiding pairs of patterns of length three
Explicit formulas for e-positivity of chromatic quasisymmetric functions
Series expansions for $1/π^m$ and $π^m$
![QR code for arXiv:0805.1280 [math.CO]](http://oss.arxitics.com/images/favicon.svg)