Avoidance of partitions of a three-element set
From MaRDI portal
Abstract: Klazar defined and studied a notion of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations. Sagan considered partitions which avoid a single partition of three elements. We enumerate partitions which avoid any family of partitions of a 3-element set as was done by Simion and Schmidt for permutations. We also consider even and odd set partitions. We provide enumerative results for set partitions restricted by generalized set partition patterns, which are an analogue of the generalized permutation patterns of Babson and Steingr{'{i}}msson. Finally, in the spirit of work done by Babson and Steingr{'{i}}msson, we will show how these generalized partition patterns can be used to describe set partition statistics.
Recommendations
Cites work
- scientific article; zbMATH DE number 3456973 (Why is no real title available?)
- scientific article; zbMATH DE number 3467213 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A maj statistic for set partitions
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
- Crossings and nestings of matchings and partitions
- Distribution of crossings, nestings and alignments of two edges in matchings and partitions
- Generalized permutation patterns and a classification of the Mahonian statistics
- Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
- Noncrossing partitions
- On \(abab\)-free and \(abba\)-free set partitions
- On partitions avoiding 3-crossings
- Pattern avoidance in set partitions.
- Rationality of the Möbius function of a composition poset
- Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
- Restricted permutations
- Set partition statistics and \(q\)-Fibonacci numbers
- Steep polyominoes, \(q\)-Motzkin numbers and \(q\)-Bessel functions
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The Möbius function of a composition poset
- The patterns of permutations
- The q-Stirling numbers of first and second kinds
- \(p,q\)-Stirling numbers and set partition statistics
- \(q\)-Bernoulli numbers and polynomials
- q-Abel polynomials
Cited in
(27)- Pattern avoidance in set partitions.
- Asymptotic results on Klazar set partition avoidance
- Embedding dualities for set partitions and for relational structures
- On multiple pattern avoiding set partitions
- Pattern avoidance in ordered set partitions
- The Dyck pattern poset
- Ordered partitions avoiding a permutation pattern of length 3
- Generalized pattern avoidance
- Combinatorial generation via permutation languages. VI: Binary trees
- Restricted partitions and \(q\)-Pell numbers
- Pattern avoidance in matchings and partitions
- Avoiding type \((1,2)\) or \((2,1)\) patterns in a partition of a set
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
- Pattern avoidance in ``flattened partitions
- Pattern avoidance and dominating compositions
- Left-right arrangements, set partitions and pattern avoidance
- Permutation classes and polyomino classes with excluded submatrices
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
- Pattern avoiding partitions and Motzkin left factors
- Set partition patterns and the dimension index
- Set partition patterns and statistics
- Pattern avoidance for set partitions à la Klazar
- Set partition statistics and \(q\)-Fibonacci numbers
- Pattern avoidance in ordered set partitions and words
- Catalan numbers and pattern restricted set partitions
- Dyck paths, binary words, and Grassmannian permutations avoiding an increasing pattern
- Restricted growth function patterns and statistics
This page was built for publication: Avoidance of partitions of a three-element set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q928779)
