String pattern avoidance in generalized non-crossing trees

MaRDI QIDQ3575446zbMATH OpenFDO

Authors Yidong Sun, Zhiping Wang

Publication date 27 July 2010

Full work available at URL https://arxiv.org/abs/0805.1280, https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/957/0.html

zbMATH Keywords

Catalan numberpattern avoidancegeneralized non-crossing treelittle Schröder path

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10)

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.

Recommendations

• Consecutive pattern avoidances in non-crossing trees
• Pattern avoidance in binary trees
• Non-contiguous pattern avoidance in binary trees
• Pattern avoidance in ternary trees
• Generating trees for permutations avoiding generalized patterns

Cited in

(5)

• Non-contiguous pattern avoidance in binary trees
• Consecutive pattern avoidances in non-crossing trees
• Pattern Avoidance and Overlap in Strings
• A refinement of leaves on noncrossing trees
• Pattern avoidance in binary trees

This page was built for publication: String pattern avoidance in generalized non-crossing trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575446)