The following pages link to On pattern-avoiding partitions (Q1010749):
Displaying 20 items.
- Counting ordered graphs that avoid certain subgraphs (Q279199) (← links)
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials (Q384775) (← links)
- Some enumerative results related to ascent sequences (Q393161) (← links)
- Set partitions with circular successions (Q404458) (← links)
- Pattern avoidance in ordered set partitions (Q404537) (← links)
- Catalan numbers and pattern restricted set partitions (Q456885) (← links)
- Restricted partitions and \(q\)-Pell numbers (Q539195) (← links)
- Embedding dualities for set partitions and for relational structures (Q648966) (← links)
- Pattern avoiding partitions and Motzkin left factors (Q657426) (← links)
- Enumeration of \((k,2)\)-noncrossing partitions (Q941401) (← links)
- Block-connected set partitions (Q966144) (← links)
- Pattern avoidance in ``flattened'' partitions (Q1043596) (← links)
- Restricted growth function patterns and statistics (Q1661480) (← links)
- Pattern avoidance in matchings and partitions (Q1953480) (← links)
- Transport of patterns by Burge transpose (Q2107496) (← links)
- Sorting with pattern-avoiding stacks: the \(132\)-machine (Q2194083) (← links)
- Ordered partitions avoiding a permutation pattern of length 3 (Q2441648) (← links)
- Avoiding a pair of patterns in multisets and compositions (Q2665759) (← links)
- Fillings of skew shapes avoiding diagonal patterns (Q5074773) (← links)
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences (Q6170819) (← links)
