Pattern Avoidance in Generalized Non-crossing Trees

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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öder paths.
12 pages; 3 figures

Keywords

Combinatorics, 05A05;05C30

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/160650

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.1280
 http://arxiv.org/abs/0805.1280

Collections

arXiv