No CrossRef data available.
 $W$-OPERATOR AND NONCROSSING PARTITIONS
$W$-OPERATOR AND NONCROSSING PARTITIONSPublished online by Cambridge University Press: 23 October 2019
The  $W$-operator,
$W$-operator,  $W([n])$, generalises the cut-and-join operator. We prove that
$W([n])$, generalises the cut-and-join operator. We prove that  $W([n])$ can be written as the sum of
$W([n])$ can be written as the sum of  $n!$ terms, each term corresponding uniquely to a permutation in
$n!$ terms, each term corresponding uniquely to a permutation in  $S_{\!n}$. We also prove that there is a correspondence between the terms of
$S_{\!n}$. We also prove that there is a correspondence between the terms of  $W([n])$ with maximal degree and noncrossing partitions.
$W([n])$ with maximal degree and noncrossing partitions.