Set partition patterns and the dimension index
From MaRDI portal
Abstract: The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through the use of combinatorial statistics. We continue this work by computing the distribution of the dimension index (a statistic arising from the supercharacter theory of finite groups) across certain avoidance classes of partitions. In doing so we obtain a novel connection between noncrossing partitions and 321-avoiding permutations, as well as connections to many other combinatorial objects such as Motzkin and Fibonacci polynomials.
Recommendations
Cites work
- p,q-Stirling numbers and set partition statistics
- A uniform bijection between nonnesting and noncrossing partitions
- Actions and identities on set partitions
- Avoidance of partitions of a three-element set
- Basic characters of the unitriangular group
- Basic characters of the unitriangular group (for arbitrary primes)
- Central limit theorems for some set partition statistics
- Closed expressions for averages of set partition statistics
- Combinatorial statistics on non-crossing partitions
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Combinatorics of 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
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Generalized noncrossing partitions and combinatorics of Coxeter groups
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 1560267 (Why is no real title available?)
- Inversion polynomials for 321-avoiding permutations
- Machine learning in the string landscape
- Monoidal functors, species and Hopf algebras
- Motzkin and Catalan tunnel polynomials
- Motzkin paths and reduced decompositions for permutations with forbidden patterns
- On 1212-avoiding restricted growth functions
- On \(abab\)-free and \(abba\)-free set partitions
- Partition algebras.
- Pattern avoidance in set partitions.
- Patterns in permutations and words.
- Permutation patterns and statistics
- Restricted growth function patterns and statistics
- Set partition patterns and statistics
- Set partition statistics and q-Fibonacci numbers
- Supercharacters and superclasses for algebra groups
- Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
This page was built for publication: Set partition patterns and the dimension index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869459)
