## Front representation of set partitions

### Abstract

Let $\pi$ be a set partition of $[n]=\{1,2,...,n\}$. The standard representation of $\pi$ is the graph on the vertex set $[n]$ whose edges are the pairs $(i,j)$ of integers with $i<j$ in the same block which does not contain any integer between $i$ and $j$. The front representation of $\pi$ is the graph on the vertex set $[n]$ whose edges are the pairs $(i,j)$ of integers with $i<j$ in the same block whose smallest integer is $i$. Using the front representation, we find a recurrence relation for the number of $12... k12$-avoiding partitions for $k\geq2$. Similarly, we find a recurrence relation for the number of $k$-distant noncrossing partitions for $k=2,3$. We also prove that the front representation has several joint symmetric distributions for crossings and nestings as the standard representation does.Comment: 16 pages, 7 figures, final versio

Topics: Mathematics - Combinatorics, 05A18, 05A15, 05A19
Year: 2011
DOI identifier: 10.1137/090768266
OAI identifier: oai:arXiv.org:0907.1485

### Suggested articles

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.