Pattern Avoidance in Generalized Non-crossing Trees

Simple item page
dc.creatorSun, Yidong
dc.creatorWang, Zhiping
dc.date2008-05-09
dc.date.accessioned2026-07-07T09:37:59Z
dc.date.available2026-07-07T09:37:59Z
dc.descriptionIn 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.
dc.description12 pages; 3 figures
dc.identifierhttps://arxiv.org/abs/0805.1280
dc.identifierhttp://arxiv.org/abs/0805.1280
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/160650
dc.subjectCombinatorics
dc.subject05A05;05C30
dc.titlePattern Avoidance in Generalized Non-crossing Trees
dc.typetext

Files

Collections

arXiv