On multiple pattern avoiding set partitions

DOI10.1016/j.aam.2012.09.002zbMath1254.05025arXiv1301.6509OpenAlexW2024489128WikidataQ60692091 ScholiaQ60692091MaRDI QIDQ1932420

Mark Shattuck, Vít Jelínek, Toufik Mansour

Publication date: 18 January 2013

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

generating functionpattern avoidancenoncrossing partitionsexplicit formulaset partitionarbitrary patternavoidance classesavoidance of multiple patternsclassification of equivalence classesfull classificationgeneral equivalence criteriapairs of patternspartition containmentpattern of sizepattern-pairsWilf-equivalence class

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial identities, bijective combinatorics (05A19)

Related Items

Pattern avoidance of \([4,k\)-pairs in circular permutations] ⋮ Pattern avoidance and dominating compositions ⋮ Unnamed Item ⋮ Pattern avoidance in matchings and partitions ⋮ Ascent sequences avoiding pairs of patterns ⋮ Wilf-collapse in permutation classes having two basis elements of size three ⋮ Counting set partitions by the number of movable letters