On pattern-avoiding partitions

zbMath1179.05014arXivmath/0703898MaRDI QIDQ1010749

Toufik Mansour, Vít Jelínek

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0703898

zbMATH Keywords

Stirling numbersCatalan numbersset partitionnon crossing partitionsnon nesting partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10)

Related Items (20)

Counting ordered graphs that avoid certain subgraphs ⋮ Restricted growth function patterns and statistics ⋮ Avoiding a pair of patterns in multisets and compositions ⋮ Free rises, restricted partitions, and \(q\)-Fibonacci polynomials ⋮ Some enumerative results related to ascent sequences ⋮ Set partitions with circular successions ⋮ Pattern avoidance in ordered set partitions ⋮ Sorting with pattern-avoiding stacks: the \(132\)-machine ⋮ Inversion sequences avoiding a triple of patterns of 3 letters ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Pattern avoidance in matchings and partitions ⋮ Ordered partitions avoiding a permutation pattern of length 3 ⋮ Embedding dualities for set partitions and for relational structures ⋮ Catalan numbers and pattern restricted set partitions ⋮ Pattern avoiding partitions and Motzkin left factors ⋮ Fillings of skew shapes avoiding diagonal patterns ⋮ Block-connected set partitions ⋮ Restricted partitions and \(q\)-Pell numbers ⋮ Pattern avoidance in ``flattened partitions ⋮ Transport of patterns by Burge transpose

This page was built for publication: On pattern-avoiding partitions