Front representation of set partitions
From MaRDI portal
Abstract: Let be a set partition of . The standard representation of is the graph on the vertex set whose edges are the pairs of integers with in the same block which does not contain any integer between and . The front representation of is the graph on the vertex set whose edges are the pairs of integers with in the same block whose smallest integer is . Using the front representation, we find a recurrence relation for the number of -avoiding partitions for . Similarly, we find a recurrence relation for the number of -distant noncrossing partitions for . We also prove that the front representation has several joint symmetric distributions for crossings and nestings as the standard representation does.
Recommendations
Cited in
(6)- Restricted growth function patterns and statistics
- A simple bijection for enhanced, classical, and 2-distant \(k\)-noncrossing partitions
- From Dyck paths to standard Young tableaux
- A note on 2-distant noncrossing partitions and weighted Motzkin paths
- Vacillating Hecke tableaux and linked partitions
- Enumeration of (k,2)-noncrossing partitions
This page was built for publication: Front representation of set partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3094921)