Pages that link to "Item:Q404537"
From MaRDI portal
The following pages link to Pattern avoidance in ordered set partitions (Q404537):
Displaying 16 items.
- On pattern avoiding flattened set partitions (Q272514) (← links)
- 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 poset permutations (Q304187) (← links)
- Pattern avoiding partitions and Motzkin left factors (Q657426) (← links)
- On pattern-avoiding partitions (Q1010749) (← links)
- Large sets avoiding patterns (Q1747202) (← links)
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings (Q2323247) (← links)
- Pattern avoidance in ordered set partitions and words (Q2406542) (← links)
- Patterns in words of ordered set partitions (Q2416926) (← links)
- Ordered partitions avoiding a permutation pattern of length 3 (Q2441648) (← links)
- Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set (Q2911038) (← links)
- (Q3084740) (← links)
- The sets of flattened partitions with forbidden patterns (Q5144731) (← links)
- Counting set partitions by the number of movable letters (Q5220691) (← links)
- Avoiding colored partitions of two elements in the pattern sense (Q5404236) (← links)
- Combinatorial generation via permutation languages. VI: Binary trees (Q6612300) (← links)
