Pattern avoidance in set partitions.
From MaRDI portal
Recommendations
Cited in
(53)- On pattern-avoiding partitions
- Pattern avoidance in ``flattened partitions
- Partitions of a set satisfying certain set of conditions
- Restricted growth function patterns and statistics
- A 2D non-overlapping code over a q-ary alphabet
- On multiple pattern avoiding set partitions
- Pattern avoidance in matchings and partitions
- Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
- Counting pattern-avoiding integer partitions
- Enumeration of some classes of pattern avoiding matchings, with a glimpse into the matching pattern poset
- Transport of patterns by Burge transpose
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
- Pattern avoidance in ordered set partitions and words
- Ordered partitions avoiding a permutation pattern of length 3
- Set partition statistics and q-Fibonacci numbers
- Geometric properties of matrices induced by pattern avoidance
- On pattern avoiding flattened set partitions
- Pattern avoidance for set partitions à la Klazar
- Avoiding type (1,2) or (2,1) patterns in a partition of a set
- Permutation classes and polyomino classes with excluded submatrices
- Pattern avoidance in poset permutations
- Pattern avoiding partitions, sequence A054391, and the kernel method
- Free rises, restricted partitions, and \(q\)-Fibonacci polynomials
- Some enumerative results related to ascent sequences
- The Dyck pattern poset
- Set partitions with circular successions
- Pattern avoidance in ordered set partitions
- Enumeration schemes for vincular patterns
- Pattern-avoiding set partitions and Catalan numbers
- Asymptotic results on Klazar set partition avoidance
- Catalan numbers and pattern restricted set partitions
- Set partition patterns and statistics
- The sets of flattened partitions with forbidden patterns
- Systematic counting of restricted partitions
- On the dimension of downsets of integer partitions and compositions
- Left-right arrangements, set partitions and pattern avoidance
- Restricted partitions and \(q\)-Pell numbers
- Avoiding colored partitions of two elements in the pattern sense
- Set partition patterns and the dimension index
- Pattern avoidance and dominating compositions
- The combinatorics of a tree-like functional equation for connected chord diagrams
- Embedding dualities for set partitions and for relational structures
- Pattern avoiding partitions and Motzkin left factors
- Set partitions avoid a four-letter pattern
- Combinatorial generation via permutation languages. VI: Binary trees
- Pattern-avoiding Cayley permutations via combinatorial species
- Combinatorial exploration: an algorithmic framework for enumeration
- Self-modified difference ascent sequences
- Pattern-avoiding binary trees -- generation, counting, and bijections
- Pattern avoidance and Schur-positivity in restricted-growth words of type B
- Avoidance of partitions of a three-element set
- Enumeration of (k,2)-noncrossing partitions
- Block-connected set partitions
This page was built for publication: Pattern avoidance in set partitions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094527)
