The following pages link to Pattern avoidance in binary trees (Q986111):
Displaying 22 items.
- BinaryTrees (Q26186) (← links)
- Automatic congruences for diagonals of rational functions (Q259509) (← links)
- Geometric properties of matrices induced by pattern avoidance (Q265055) (← links)
- On coincidences of tuples in a binary tree with random labels of vertices (Q314211) (← links)
- The Dyck pattern poset (Q394536) (← links)
- On the sub-permutations of pattern avoiding permutations (Q465287) (← links)
- Modular Catalan numbers (Q730265) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Rooted forests that avoid sets of permutations (Q1715620) (← links)
- On coincidences of tuples in a \(q\)-ary tree with random labels of vertices (Q1741460) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset (Q2093265) (← links)
- Classical and consecutive pattern avoidance in rooted forests (Q2102695) (← links)
- Tree series and pattern avoidance in syntax trees (Q2194759) (← links)
- On generating series of finitely presented operads (Q2255076) (← links)
- Noncontiguous pattern containment in binary trees (Q2449274) (← links)
- Permutation classes and polyomino classes with excluded submatrices (Q2971061) (← links)
- Quotients of the Magmatic Operad: Lattice Structures and Convergent Rewrite Systems (Q3383700) (← links)
- (Q5021230) (← links)
- Wilf equivalences for patterns in rooted labeled forests (Q6118359) (← links)
- Consecutive patterns in Catalan words and the descent distribution (Q6133614) (← links)
- Stanley-Wilf limits for patterns in rooted labeled forests (Q6146494) (← links)
