Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers
Discrete Mathematics
2020-06-30 v1 Combinatorics
Abstract
A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also contain components that match subtrees or sequences of subtrees. This result extends previous versatile tree-pattern enumeration formulae to incorporate components that are only allowed to match nonleaf subtrees and provides enumerations of trees by the number of protected (shortest outgoing path has two or more edges) or unprotected nodes.
Cite
@article{arxiv.1908.04329,
title = {Nonleaf Patterns in Trees: Protected Nodes and Fine Numbers},
author = {Nachum Dershowitz},
journal= {arXiv preprint arXiv:1908.04329},
year = {2020}
}