Set partition patterns and the dimension index

zbMATH Open1497.05014arXiv2009.00650MaRDI QIDQ5869459FDOQ5869459

Authors: Thomas L. Grubb, Frederick Rajasekaran 

Publication date: 28 September 2022

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.

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

Recommendations

• Set partition patterns and statistics
• On pattern-avoiding partitions
• Avoidance of partitions of a three-element set
• Pattern avoidance in set partitions.
• On multiple pattern avoiding set partitions

zbMATH Keywords

containmentavoidancepartial ordering on set partitions

Mathematics Subject Classification ID

Partial orders, general (06A06) Partitions of sets (05A18)

Cites Work

• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• Title not available (Why is that?)
• On \(abab\)-free and \(abba\)-free set partitions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• Monoidal functors, species and Hopf algebras
• Pattern avoidance in set partitions.
• Combinatorics of set partitions
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• Basic characters of the unitriangular group
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Generalized noncrossing partitions and combinatorics of Coxeter groups
• Patterns in permutations and words.
• Basic characters of the unitriangular group (for arbitrary primes)
• Closed expressions for averages of set partition statistics
• Actions and identities on set partitions
• Supercharacters and superclasses for algebra groups
• Partition algebras.
• Permutation patterns and statistics
• Inversion polynomials for 321-avoiding permutations
• Set partition statistics and \(q\)-Fibonacci numbers
• Title not available (Why is that?)
• \(p,q\)-Stirling numbers and set partition statistics
• Avoidance of partitions of a three-element set
• Motzkin paths and reduced decompositions for permutations with forbidden patterns
• A uniform bijection between nonnesting and noncrossing partitions
• Combinatorial statistics on non-crossing partitions
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
• Central limit theorems for some set partition statistics
• Set partition patterns and statistics
• Restricted growth function patterns and statistics
• On 1212-avoiding restricted growth functions
• Machine learning in the string landscape
• Motzkin and Catalan tunnel polynomials

Cited In (1)

• Avoidable algebraic subsets of Euclidean space

Uses Software

• SageMath
• OEIS

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)