Degree of W-operator and Noncrossing Partition

TL;DR

This paper investigates the structure of the W-operator W([n]), demonstrating its decomposition into n! terms linked to permutations and establishing a connection between highest-degree terms and noncrossing partitions.

Contribution

It provides a detailed structural analysis of W([n]) and reveals a novel correspondence between its highest-degree terms and noncrossing partitions.

Findings

W([n]) decomposes into n! terms, each associated with a permutation.

Highest-degree terms of W([n]) correspond to noncrossing partitions.

The degree of each term is explicitly defined and analyzed.

Abstract

Goulden and Jackson first introduced the cut-and-join operator. The cut-and-join is widely used in studying the Hurwitz number and many other topological recursion problems. Mironov, Morosov and Natanzon give a more general construction and call it W-operator W([n]). As a special case, the cut-and-join operator is W([2]). In this paper, we study the structure of W([n]). We prove that W([n]) can be written as the sum of n! terms and each term corresponds uniquely to a permutation in Sn. We also define the degree of each term. We prove that there is a correspondence between the terms of W([n]) with highest degree and the noncrossing partitions.