The following pages link to (Q3084744):
Displayed 6 items.
- The (ordinary) generating functions enumerating \(123\)-avoiding words with \(r\) occurrences of each of \(1, 2, \dots, n\) are always algebraic (Q295298) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- Refining enumeration schemes to count according to permutation statistics (Q405263) (← links)
- Enumeration schemes for vincular patterns (Q418874) (← links)
- Subregularity in infinitely labeled generating trees of restricted permutations (Q2155932) (← links)
- On avoiding 1233 (Q5045252) (← links)