Patterns in words of ordered set partitions

Abstract

An ordered set partition of $\{1,2,\ldots,n\}$ is a partition with an ordering on the parts. let $\OP_{n,k}$ be the set of ordered set partitions of $[n]$ with $k$ blocks, Godbole, Goyt, Herdan and Pudwell defined $\OP_{n,k}(\sigma)$ to be the set of ordered set partitions in $\OP_{n,k}$ avoiding a permutation pattern $\sigma$ and obtained the formula for $|\OP_{n,k}(\sigma)|$ when the pattern $\sigma$ is of length $2$. Later, Chen, Dai and Zhou found a formula algebraically for $|\OP_{n,k}(\sigma)|$ when the pattern $\sigma$ is of length $3$. In this paper, we define a new pattern avoidance for the set $\OP_{n,k}$, called $\WOP_{n,k}(\sigma)$, which includes the questions proposed by Godbole \textit{et al.} We obtain formulas for $|\WOP_{n,k}(\sigma)|$ combinatorially for any $\sigma$ of length $\leq 3$. We also define 3 kinds of descent statistics on ordered set partitions and study the distribution of the descent statistics on $\WOP_{n,k}(\sigma)$ for $\sigma$ of length $\leq 3$.