Abstract
We derive a closed-form formula 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 formulæ 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.
| Original language | English |
|---|---|
| Article number | 20.7.7 |
| Pages (from-to) | 1-17 |
| Number of pages | 17 |
| Journal | Journal of Integer Sequences |
| Volume | 23 |
| Issue number | 7 |
| State | Published - 2020 |
Keywords
- Dyck path
- Fine number
- Fine path
- Hill
- Lattice path
- Protected node
- Tree enumeration
- Tree pattern