Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
From MaRDI portal
Publication:1972357
DOI10.1006/eujc.1999.0353zbMath0946.05004OpenAlexW2040306972MaRDI QIDQ1972357
Publication date: 7 June 2000
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e5c53134eed098d3bc36c2a6f9445feaffaf8006
Related Items (14)
Hereditary properties of partitions, ordered graphs and ordered hypergraphs ⋮ Extensions of the linear bound in the Füredi-Hajnal conjecture ⋮ Restricted growth function patterns and statistics ⋮ Set Partition Patterns and the Dimension Index ⋮ Excluded permutation matrices and the Stanley-Wilf conjecture ⋮ Pattern avoidance in ordered set partitions and words ⋮ Pattern avoidance in ordered set partitions ⋮ Ordered partitions avoiding a permutation pattern of length 3 ⋮ Embedding dualities for set partitions and for relational structures ⋮ Avoidance of partitions of a three-element set ⋮ Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings ⋮ Pattern avoidance in ``flattened partitions ⋮ Some binomial formulas of the generalized Appell form ⋮ On the dimension of downsets of integer partitions and compositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
- Symmetric functions and P-recursiveness
- A correspondence between ordered trees and noncrossing partitions
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- Ordered trees and non-crossing partitions
- Differentiably finite power series
- On the structure of the lattice of noncrossing partitions
- On some new sequences generalizing the Catalan and Motzkin numbers
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Partitions with \(k\) crossings
- Combinatorial statistics on non-crossing partitions
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Permutations avoiding certain patterns: The case of length 4 and some generalizations
- Free probability theory and non-crossing partitions
- On geometric graphs with no two edges in convex position
- Asymptotic values for degrees associated with strips of Young diagrams
- On \(abab\)-free and \(abba\)-free set partitions
- Classification of forbidden subsequences of length 4
- Generating trees and forbidden subsequences
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
- The theory of well-quasi-ordering: a frequently discovered concept
- Étude et denombrement parallèles des partitions non-croisees d'un cycle et des decoupages d'un polygone convexe
- Well-quasi-orderings and sets of finite sequences
- Restricted permutations
This page was built for publication: Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
