String pattern avoidance in generalized non-crossing trees
2009 ◽
Vol Vol. 11 no. 1
(Combinatorics)
◽
Keyword(s):
Combinatorics International audience The problem of string pattern avoidance in generalized non-crossing trees is studied. The generating functions for generalized non-crossing trees avoiding string patterns of length one and two are obtained. The Lagrange inversion formula is used to obtain the explicit formulas for some special cases. A bijection is also established between generalized non-crossing trees with special string pattern avoidance and little Schr ̈oder paths.
Keyword(s):
1964 ◽
Vol 17
(2)
◽
pp. 137-146
◽
2001 ◽
Vol 45
(1)
◽
pp. 164-172
◽
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
1987 ◽
Vol 45
(2)
◽
pp. 178-195
◽
Keyword(s):
1980 ◽
Vol 257
(2)
◽
pp. 455-455
◽