A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Counting Subwords in a Partition of a Set

2010
*
Electronic Journal of Combinatorics
*

A partition $\pi$ of the set $[n]=\{1,\ldots,n\}$ is a collection $\{B_1,\ldots ,B_k\}$ of nonempty disjoint subsets of $[n]$ (called blocks) whose union equals $[n]$. In this paper, we find explicit formulas for the generating functions for the number of partitions of $[n]$ containing exactly $k$ blocks where $k$ is fixed according to the number of occurrences of a subword pattern $\tau$ for several classes of patterns, including all words of length 3. In addition, we find simple explicit

doi:10.37236/291
fatcat:o2cpqf7mlfcbxjxoabjl3zu57y