2.1 Complex reflections groups

Let V be a finite-dimensional complex vector space. A linear transformation $\rho \in \mathrm {GL(V)}$ is said to be a reflection of V if it has finite order and if the fixed-point set

$$ \begin{align*} \{\mathrm{\mathbf{v}}\in V\;|\;\rho(\mathrm{\mathbf{v}})=\mathrm{\mathbf{v}}\} \end{align*} $$

is a complex hyperplane in V. A complex reflection group is a finite subgroup $G\subset \mathrm {GL}(V)$ that is generated by reflections.

The data of a complex reflection group is more than just an abstract group; the complex vector space V and an embedding in $\mathrm {GL}(V)$ must also be specified. As opposed to reflections of real vector spaces, reflections of complex vector spaces do not necessarily have order two. A simple example of a complex reflection with order greater than two is multiplication by a primitive rth root of unity, with $r>0$ , viewed as an element of $\mathrm {GL}(\mathbb {C})$ .

The next example provides a general description of all of the reflections that will be considered in this paper and establishes notation that will be used throughout.

The previous example provides us with a wealth of complex reflections. The next two examples describe the complex reflection groups that can be generated by sets of these reflections. We begin with the most classical example: the symmetric group.

Example 2.2 Let $V=\mathbb {C}^n$ . The complex reflection group in $\mathrm {GL}(V)$ generated by

$$ \begin{align*} \left\{\sigma_{ij}\;|\; 1\leq i<j\leq n\right\} \end{align*} $$

is isomorphic to the symmetric group $S_n$ , which is embedded in $\mathrm {GL}(V)$ as the set of linear transformations that permute the coordinates of V. Concretely, $S_n$ can be described as the set of permutation matrices—the $n\times n$ matrices with a single $1$ in each row and column and zeros elsewhere. These matrices act on $V=\mathbb {C}^n$ by matrix multiplication on the left.

The class of complex reflection groups that are of primary interest in this work are a natural generalization of the symmetric group. They are described in the following example.

Example 2.3 Let $V=\mathbb {C}^n$ and let r and s be positive integers such that $s\mid r$ . The complex reflection group $G(r,s,n)\subset \mathrm {GL(V)}$ is the group generated by

(2.1) $$ \begin{align} \left\{\sigma_{ij}^{k/r}\;\Big|\; {1\leq i<j\leq n \atop 0\leq k< r}\right\}\cup \left\{\tau_i^{sk/r}\;\Big|\; {1\leq i\leq n \atop 0< k< r/s}\right\}. \end{align} $$

Concretely, the elements of $G(r,s,n)$ are the $n\times n$ matrices (acting on V by matrix multiplication on the left) that satisfy the following three conditions:

1. (1) each row and column has a single nonzero entry,

2. (2) each nonzero entry is an rth root of unity, and

3. (3) the product of the nonzero entries is an $(r/s)$ th root of unity.

It can be checked that the generating set in (2.1) is a complete list of reflections in $G(r,s,n)$ . We let R denote this set and write

$$ \begin{align*} R=R_1 \sqcup R_2, \end{align*} $$

where $R_1=\{\sigma _{ij}^{k/r}\}$ and $R_2=\{\tau _i^{sk/r}\}$ . Notice that $R_2=\emptyset $ unless $s<r$ .

As familiar special cases of $G(r,s,n)$ , observe that $G(1,1,n)$ is the symmetric group $S_n$ , while $G(r,s,1)=\mu _{r/s}$ is the group of $(r/s)$ th roots of unity. It can also be shown that the dihedral groups are isomorphic to $G(r,r,2)$ for $r>2$ . For example, the symmetries of the square are isomorphic to $G(4,4,2)$ .

Irreducible complex reflection groups were classified by Shephard and Todd in [Reference Shephard and Todd12]. In addition to the infinite family $G(r,s,n)$ described in Example 2.3, Shephard and Todd described a list of 34 exceptional groups, and they showed that every complex reflection group can be decomposed uniquely as a product, each factor of which is either $G(r,s,n)$ for some $(r,s,n)$ or one of the exceptional groups. As the only infinite family in the classification, the groups of the form $G(r,s,n)$ play an especially important role in the theory of complex reflection groups.

There are two natural group homomorphisms between complex reflection groups that are important. The first is the homomorphism

$$ \begin{align*} \pi:G(r,s,n)\rightarrow S_n \end{align*} $$

that replaces every nonzero entry in a matrix $\omega \in G(r,s,n)$ with $1$ . The second is the homomorphism

$$ \begin{align*} \phi:G(r,s,n)\rightarrow \mu_{r/s} \end{align*} $$

that computes the product of all of the nonzero entries in a matrix $\omega \in G(r,s,n)$ . The function $\delta $ appearing in the statement of polynomiality is related to the homomorphism $\phi $ ; it is defined by

$$ \begin{align*} \delta:G(r,s,n)&\rightarrow\{0,1\},\\ \omega&\mapsto\begin{cases} 1,&\text{ if }\phi(\omega)=1,\\ 0,&\text{ if }\phi(\omega)\neq 1. \end{cases} \end{align*} $$

2.2 Factorizations

Given an element $\omega \in G(r,s,n)$ , our goal is to study the number of ways it can be factored into reflections. More precisely, define the factorization set $F^\omega _m\subseteq R^m$ to be the set of ways to write $\omega $ as a product of m reflections:

$$ \begin{align*} F^\omega_m:=\left\{(\rho_1,\dots,\rho_m)\in R^m\;|\;\rho_m\cdots \rho_1=\omega\right\}. \end{align*} $$

We are interested in the size of this factorization set:

$$ \begin{align*} f^\omega_m:=|F^\omega_m|. \end{align*} $$

Notice that the notation $(r,s,n)$ has been omitted from these definitions because it is encoded by the element $\omega $ , which is always understood to be an element of some $G(r,s,n)$ .

Given a factorization

$$ \begin{align*} \rho_m\cdots \rho_1=\omega\in G(r,s,n), \end{align*} $$

we obtain an identity in $S_n$ by applying the homomorphism $\pi $ :

$$ \begin{align*} \pi(\rho_m)\cdots\pi(\rho_1)=\pi(\omega)\in S_n. \end{align*} $$

However, $\left (\pi (\rho _1),\dots ,\pi (\rho _m)\right )$ is not necessarily an element of $F^{\pi (\omega )}_m$ , because $\pi (\rho _j)$ will be the identity whenever $\rho _j\in R_2$ . Thus, if we want to compare factorizations in $G(r,s,n)$ with factorizations in $S_n$ , it makes sense to refine the factorizations by the number of factors that belong to $R_1$ and $R_2$ .

For an element $\omega \in G(r,s,n)$ and nonnegative integers $m_1$ and $m_2$ such that $m=m_1+m_2$ , define the refined factorization set as

$$ \begin{align*} F^\omega_{m_1,m_2}:=\left\{(\rho_1,\dots,\rho_m)\in R^{m}\;\Big|\;{\rho_m\cdots \rho_1=\omega \atop |\{i\;|\;\rho_i\in R_j\}|=m_j}\right\}\subseteq F_m^\omega, \end{align*} $$

and define

$$ \begin{align*} f^\omega_{m_1,m_2}:=|F^\omega_{m_1,m_2}|. \end{align*} $$

Notice that

$$ \begin{align*} f^\omega_{m}=\sum_{m_1+m_2=m}f_{m_1,m_2}^\omega. \end{align*} $$

Applying the homomorphism $\pi $ to each factor then defines a function from the factorization set $F^\omega _{m_1,m_2}$ to the factorization set $F^{\pi (\omega )}_{m_1}$ , which, by a slight abuse of notation, we also denote by $\pi $ :

(2.2) $$ \begin{align} \pi:F^\omega_{m_1,m_2}\rightarrow F^{\pi(\omega)}_{m_1}. \end{align} $$

In order to compare the number of factorizations of $\omega \in G(r,s,n)$ to the number of factorizations of $\pi (\omega )\in S_n$ , it suffices to understand the preimages of the function in (2.2).

2.3 Factorization graphs

To assist in our study of the factorization sets introduced in the previous subsection, we introduce a combinatorial interpretation of those sets in terms of decorated graphs, and we prove several results concerning these graphs that will be useful in Section 3.

For our purposes, a graph on the vertex set $V=[n]=\{1,\dots ,n\}$ consists of an ordered set of edges $E=(e_1,\dots ,e_m)$ where each edge $e\in E$ is a multiset of order two: $e=\{i,j\}$ with $i,j\in [n]$ . For clarity, it’s worth noting that

• • the set of edges is ordered and

• • self-edges and multiple edges are allowed.

We often require subsets of edges to preserve the ordering, and we write $E'\preceq E$ to denote a subset of edges with the induced ordering. The ordered set of edges containing two distinct vertices is denoted $E_1\preceq E$ and the ordered set of self-edges is denoted $E_2\preceq E$ .

The graphs that encode factorizations in $G(r,s,n)$ have an additional edge labeling. In particular, we decorate each edge $e\in E$ by an integer $\mathrm {k}(e)$ that satisfies the following constraints:

$$ \begin{align*} \begin{cases} 0\leq \mathrm{k}(e)< r, &\text{ if }e\in E_1,\\ 0< \mathrm{k}(e)< r/s, &\text{ if }e\in E_2. \end{cases} \end{align*} $$

We define $\Gamma _m(r,s,n)$ to be the set of graphs with m ordered edges on the vertex set $[n]$ along with an edge labeling as above. If $r=s$ , then $E_2=\emptyset $ , because self-edges are impossible to label under the above constraints. Let $\Gamma _{m_1,m_2}(r,s,n)\subseteq \Gamma _m(r,s,n)$ denote the subset of graphs such that $|E_1|=m_1$ and $|E_2|=m_2$ .

Example 2.4 The following is a depiction of a graph in $\Gamma _{5,2}(6,2,4)$ . Each edge is the multiset containing the two vertices it attaches; for example, $e_5=\{3,4\}$ and $e_7=\{1,1\}$ . To keep the graph uncluttered, the edge labels are listed to the right instead of along the edges.

The reason we have introduced decorated graphs is because each graph in $\Gamma _m(r,s,n)$ corresponds to an m-tuple of reflections $(\rho _1,\dots ,\rho _m)\in R^m\subseteq G(r,s,n)^m$ in a natural way. Specifically, for each edge $e\in E$ , we associate a reflection $\rho \in R$ via the rule

(2.3) $$ \begin{align} \rho=\begin{cases} \sigma_{ij}^{\mathrm{k}(e)/r,} &\text{ if } e=\{i,j\}\in E_1\text{ with } i<j,\\ \tau_i^{s\mathrm{k}(e)/r,} &\text{ if } e=\{i,i\}\in E_2. \end{cases} \end{align} $$

Conversely, given an m-tuple of reflections $(\rho _1,\dots ,\rho _m)\in R^m\subseteq G(r,s,n)^m$ , we associate a decorated graph in $\Gamma _m(r,s,n)$ with edges and edge labels specified by

(2.4) $$ \begin{align} (e,\mathrm{k}(e))=\begin{cases} \left(\{i,j\},k\right) &\text{ if } \rho=\sigma_{ij}^{k/r}\in R_1,\\ \left(\{i,i\},k\right) &\text{ if } \rho=\tau_{i}^{sk/r}\in R_2. \end{cases} \end{align} $$

The identifications in (2.3) and (2.4) are inverse to each other, and we henceforth use them to identify the set of graphs in $\Gamma _m(r,s,n)$ with the set of m-tuples of reflections in $G(r,s,n)$ :

(2.5) $$ \begin{align} \Gamma_m(r,s,n)=R^m\subseteq G(r,s,n)^m. \end{align} $$

The subset $\Gamma _{m_1,m_2}(r,s,n)\subseteq \Gamma _m(r,s,n)=R^m$ corresponds to those m-tuples of reflections where $m_1$ of the reflections belong to $R_1$ and $m_2$ of the reflections belong to $R_2$ .

Example 2.5 The decorated graph in $\Gamma _{5,2}(6,2,4)$ depicted in Example 2.4 is associated to the following seven-tuple of reflections in $G(6,2,4)$ :

$$ \begin{align*} \left(\sigma_{34}^5, \sigma_{23}^0,\tau_4^4, \sigma_{12}^1, \sigma_{34}^3, \sigma_{13}^4, \tau_1^2\right). \end{align*} $$

Given a graph $\gamma \in \Gamma _m(r,s,n)$ , let $\omega $ be the product of the corresponding m-tuple of reflections: $\omega =\rho _m\cdots \rho _1$ . Then, by definition, $(\rho _1,\dots ,\rho _m)\in F^\omega _m$ . For each $\omega \in G(r,s,n)$ , let $\Gamma ^\omega _m\subseteq \Gamma _m(r,s,n)$ and $\Gamma ^\omega _{m_1,m_2}\subseteq \Gamma _{m_1,m_2}(r,s,n)$ denote the subsets of graphs whose corresponding reflections multiply to $\omega $ . By definition, the identification (2.5) induces an identification of these subsets with the appropriate factorization sets:

Our next goal is to better understand the subsets $\Gamma _m^\omega \subseteq \Gamma _m(r,s,n)$ . In particular, given a graph in $\Gamma _m(r,s,n)$ , we know that it belongs to $\Gamma _m^\omega $ for some $\omega $ , and we would like to be able to describe $\omega $ in terms of the graph. For this, we turn to a discussion of ordered edge walks.

Let $\gamma \in \Gamma _{m}(r,s,n)$ be a graph with edge set $E=(e_1,\dots ,e_m)$ . A directed edge $\vec e=(i_0,i_1)$ consists of an edge $e=\{i_0,i_1\}\in E$ along with a choice of ordering of the two vertices. Notice that every edge in $E_1$ has two possible directions, while edges in $E_2$ have only one possible direction. Given a directed edge $\vec e=(i_0,i_1)$ , we denote the head and tail by $\mathrm {h}(\vec e)=i_1$ and $\mathrm {t}(\vec e)=i_0$ , respectively. A walk in $\gamma $ is a set of directed edges $w=(\vec s_1,\dots ,\vec s_\ell )$ such that $\mathrm {h}(\vec s_j)=\mathrm {t}(\vec s_{j+1})$ for $j=1,\dots ,\ell -1$ . A step of the walk refers to a single directed edge $\vec s_j$ . The start and end of the walk refer to $\mathrm {t}(\vec s_1)$ and $\mathrm {h}(\vec s_\ell )$ , respectively. We use the following notation to denote walks:

$$ \begin{align*} w=(i_0\stackrel{s_1}{\longrightarrow} i_1\stackrel{s_2}{\longrightarrow} \cdots \stackrel{s_\ell}{\longrightarrow} i_\ell), \end{align*} $$

where $\mathrm {h}(\vec s_j)=i_j$ and $\mathrm {t}(\vec s_j)=i_{j-1}$ for all $j=1,\dots ,\ell $ . We say that a walk is ordered if the order of the steps is consistent with the ordering of edges: $(s_1,\dots ,s_\ell )\preceq E$ .

Given a graph $\gamma \in \Gamma _{m}(r,s,n)$ and a vertex $i\in [n]$ , there is a natural ordered walk $w_i=w_i(\gamma )$ that starts at vertex i and sequentially walks along the edges $e_1,e_2,\dots ,e_m$ . More specifically, starting at vertex $i=i_0$ , let $s_1=\{i_0,i_1\}$ be the first edge in E that contains $i_0$ , and define $\vec s_1=(i_0,i_1)$ . Next, let $s_2=\{i_1,i_2\}$ be the first edge in E that occurs after $s_1$ and contains $i_1$ , and define $\vec s_1=(i_1,i_2)$ . Continue in this way until, for some $i_\ell $ , there does not exist an edge in E that occurs after $s_\ell $ and contains $i_\ell $ . When this happens, stop the recursion, and define

$$ \begin{align*} w_i(\gamma)=(i_0\stackrel{s_1}{\longrightarrow} i_1\stackrel{s_2}{\longrightarrow} \cdots \stackrel{s_\ell}{\longrightarrow} i_\ell). \end{align*} $$

If i is not contained in any edges, then $w_i$ is the trivial walk that starts and ends at i and does not have any steps.

Example 2.6 Consider the graph in Example 2.4. By starting at each vertex and following the edges sequentially, the four ordered edge walks we obtain are:

$$ \begin{align*} w_1&=(1\stackrel{e_4}{\longrightarrow} 2);\\ w_2&=(2\stackrel{e_2}{\longrightarrow} 3\stackrel{e_5}{\longrightarrow} 4);\\ w_3&=(3\stackrel{e_1}{\longrightarrow} 4\stackrel{e_3}{\longrightarrow} 4\stackrel{e_5}{\longrightarrow} 3\stackrel{e_6}{\longrightarrow} 1\stackrel{e_7}{\longrightarrow} 1);\\ w_4&=(4\stackrel{e_1}{\longrightarrow} 3\stackrel{e_2}{\longrightarrow} 2\stackrel{e_4}{\longrightarrow} 1\stackrel{e_6}{\longrightarrow} 3). \end{align*} $$

The next result is a useful observation about these ordered edge walks. It can be checked explicitly in Example 2.6.

Proof Given a graph $\gamma \in \Gamma _m(r,s,n)$ and a directed edge $\vec e$ , let’s walk backwards to find an i such that $\vec e$ is a step on $w_i$ . More specifically, let $s_{\text {-}1}=\{i_{\text {-}1},i_0\}$ be the last edge' before e that contains $i_0=\mathrm {t}(\vec e)$ , and define $\vec s_{\text {-}1}=(i_{\text {-}1},i_0)$ . Then let $s_{\text {-}2}=\{i_{\text {-}2},i_{\text {-}1}\}$ be the last edge before $s_{\text {-}1}$ that contains $i_{\text {-}1}$ , and define $\vec s_2=(i_{\text {-}2},i_{\text {-}1})$ . Continue in this way until, for some $i_{\text {-}\ell }$ , there does not exist an edge before $s_{\text {-}\ell }$ that contains $i_{\text {-}\ell }$ , and define $i=i_{\text {-}\ell }$ . By construction, the walk $w_i$ is equal to

$$ \begin{align*} w_i=(i_{\text{-}\ell}\stackrel{s_{\text{-}\ell}}{\longrightarrow} \cdots \stackrel{s_{\text{-}1}}{\longrightarrow} \mathrm{t}(\vec e)\stackrel{e}{\longrightarrow} \mathrm{h}(\vec e)\stackrel{s_1}{\longrightarrow} \cdots \stackrel{s_{\ell'}}{\longrightarrow} i_{\ell'}) \end{align*} $$

for some directed edges $\vec s_1,\dots ,\vec s_{\ell '}$ . Thus, $\vec e$ is a step on the walk $w_i$ .

To see that $\vec e$ cannot be a step on more than one walk $w_i$ , it is enough to notice that, given a step on a walk $w_i$ , both the preceding and the following step are uniquely determined. Thus, if two walks $w_i$ and $w_j$ share one step, then they must share all of their steps.▪

So far, the ordered walks $w_i$ only take into account the ordering of the edges, but not the labels. We now take into consideration the edge labels. We define the weight of a directed edge by

$$ \begin{align*} \mathrm{k}(\vec e)=\begin{cases} \mathrm{k}(e), & \text{ if } \mathrm{h}(\vec e)> \mathrm{t}(\vec e),\\ s\mathrm{k}(e), & \text{ if } \mathrm{h}(\vec e) = \mathrm{t}(\vec e),\\ -\mathrm{k}(e), & \text{ if } \mathrm{h}(\vec e) < \mathrm{t}(\vec e), \end{cases} \end{align*} $$

where the three cases are referred to as up-steps, loops, and down-steps, respectively. The weight of a walk $w=(\vec s_1,\dots ,\vec s_\ell )$ is defined by

$$ \begin{align*} \mathrm{k}(w)=\sum_{j=1}^\ell \mathrm{k}(\vec s_j). \end{align*} $$

Example 2.8 Consider the decorated graph in Example 2.4 with walks described in Example 2.6. We compute the weights of these walks:

$$ \begin{align*} \mathrm{k}(w_1)&=1;\\ \mathrm{k}(w_2)&=0+3=3;\\ \mathrm{k}(w_3)&=5+2\cdot 2-3-4+2\cdot 1=4;\\ \mathrm{k}(w_4)&=-5-0-1+4=-2. \end{align*} $$

Given the above definitions, we are now ready to characterize those graphs in $\Gamma _m(r,s,n)$ that correspond to factorizations of $\omega \in G(r,s,n)$ . This is the content of the next result.

Proposition 2.9 Let $\omega $ be an element of $G(r,s,n)$ and let $\gamma \in \Gamma _m(r,s,n)$ be a decorated graph. Then $\gamma \in \Gamma _m^\omega $ if and only if

$$ \begin{align*} \omega(\mathrm{\mathbf{v}}_i)=\zeta_r^{\mathrm{k}(w_i)}\mathrm{\mathbf{v}}_{\mathrm{h}(w_i)}\;\;\text{ for all }\;\;i=1,\dots,n, \end{align*} $$

where $\mathrm {\mathbf {v}}_1,\dots ,\mathrm {\mathbf {v}}_n$ are the standard basis vectors of $\mathbb {C}^n$ .

Before proving the proposition, we return one last time to our running example.

Example 2.10 Using the values of $\mathrm {h}(w_i)$ and $\mathrm {k}(w_i)$ computed in Examples 2.6 and 2.8, we see that the decorated graph in $\Gamma _{5,2}(6,2,4)$ depicted in Example 2.4 corresponds to a length- $7$ factorization of

$$ \begin{align*} \left( \begin{array}{cccc} 0 & 0 & \zeta_6^4 & 0\\ \zeta_6 & 0 & 0 & 0\\ 0 & 0 & 0 & \zeta_6^4\\ 0 & \zeta_6^3 & 0 & 0\\ \end{array} \right)\in G(6,2,4). \end{align*} $$

This can be checked explicitly by multiplying the seven elements listed in Example 2.5.

Proof of Proposition 2.9 Let $\gamma \in \Gamma _m(r,s,n)$ be a decorated graph and consider the associated reflections $(\rho _1,\dots ,\rho _m)$ defined in (2.3). By definition, $\gamma \in \Gamma _m^\omega $ if and only if $\rho _m\cdots \rho _1=\omega $ , and this equality can be verified by checking that both sides act the same way on the standard basis vectors. Thus, we must prove that

$$ \begin{align*} \rho_m\cdots\rho_1(\mathrm{\mathbf{v}}_i)=\zeta_r^{\mathrm{k}(w_i)}\mathrm{\mathbf{v}}_{\mathrm{h}(w_i)}\;\;\text{ for all }\;\;i=1,\dots,n. \end{align*} $$

Fix $i_0\in [n]$ . In order to compute $\rho _m\cdots \rho _1(\mathrm {\mathbf {v}}_{i_0})$ , we begin by looking for the first reflection $r_1\in (\rho _1,\dots ,\rho _l)$ of the form $r_1=\sigma _{i_0i_1}^{k/r}$ , $r_1=\tau _{i_0}^{sk/r}$ , or $r_1=\sigma _{i_1i_0}^{k/r}$ . All other reflections fix $\mathrm {\mathbf {v}}_{i_0}$ , so they can be ignored for the purposes of this calculation. Notice that the edge $s_1$ in $\gamma $ corresponding to the reflection $r_1$ is the first step in the walk $w_{i_0}=(\vec s_1,\dots ,\vec s_\ell )$ , and the three possibilities for $r_1$ characterize whether $\vec s_1$ is an up-step, a loop, or a down-step. In each case, we compute

$$ \begin{align*} r_1(\mathrm{\mathbf{v}}_{i_0})&=\begin{cases} \zeta_r^k\mathrm{\mathbf{v}}_{i_1} &\text{ if } r_1=\sigma_{i_0i_1}^{k/r}\\ \zeta_r^{sk}\mathrm{\mathbf{v}}_{i_0} & \text{ if } r_1=\tau_{i_0}^{sk/r}\\ \zeta_r^{-k}\mathrm{\mathbf{v}}_{i_1} & \text{ if }r_1=\sigma_{i_1i_0}^{k/r} \end{cases}\\ &=\zeta_r^{\mathrm{k}(\vec s_1)}\mathrm{\mathbf{v}}_{\mathrm{h}(\vec s_1)}. \end{align*} $$

Next, look for the first reflection $r_2\in (\rho _1,\dots ,\rho _\ell )$ occurring after $r_1$ of the form $r_2=\sigma _{\mathrm {h}(\vec s_1)i_2}^{k/r}$ , $r_2=\tau _{\mathrm {h}(\vec s_1)}^{sk/r}$ , or $r_2=\sigma _{i_2\mathrm {h}(\vec s_1)}^{k/r}$ . By the same argument as above,

$$ \begin{align*} r_2(r_1(\mathrm{\mathbf{v}}_{i_0}))&=r_2(\zeta_r^{\mathrm{k}(\vec s_1)}\mathrm{\mathbf{v}}_{\mathrm{h}(\vec s_1)})\\ &=\zeta_r^{\mathrm{k}(\vec s_1)+\mathrm{k}(\vec s_2)}\mathrm{\mathbf{v}}_{\mathrm{h}(\vec s_2)}. \end{align*} $$

Continuing in this way, we construct a list of elements $(r_1,\dots ,r_l)\preceq (\rho _1,\dots ,\rho _m)$ such that

$$ \begin{align*} \rho_m\cdots\rho_1(\mathrm{\mathbf{v}}_{i_0})&=r_\ell\cdots r_1(\mathrm{\mathbf{v}}_{i_0})\\ &=\zeta_r^{\mathrm{k}(\vec s_1)+\cdots+\mathrm{k}(\vec s_\ell)}\mathrm{\mathbf{v}}_{\mathrm{h}(\vec s_\ell)}\\ &=\zeta_r^{\mathrm{k}(w_{i_0})}\mathrm{\mathbf{v}}_{\mathrm{h}(w_{i_0})}.\\[-33pt] \end{align*} $$

▪

2.4 Connected factorizations

Our main results in Section 3 are stated in terms of connected factorizations. In this subsection, we introduce connected factorizations and describe how they generalize the transitive factorizations in $S_n$ . We also prove that every factorization number can be computed from the connected factorization numbers.

Let $\omega \in G(r,s,n)$ . We say that a factorization

$$ \begin{align*} (\rho_1,\dots,\rho_m)\in F^\omega_m \end{align*} $$

is connected if the corresponding graph $\gamma \in \Gamma _m^\omega $ is connected, in the sense that there exists at least one walk between any two vertices. The following proposition shows how the notion of connected factorizations in $G(r,s,n)$ generalizes that of transitive factorization in $S_n$ .Footnote ²

Proof Let $(\rho _1,\dots ,\rho _m)\in F^\omega _m$ be a factorization with associated graph $\gamma \in \Gamma ^\omega _m$ .

Suppose that $\gamma $ is connected. To prove that the subgroup generated by $\{\pi (\rho _1),\dots ,\pi (\rho _m)\}$ acts transitively on $\{\mathrm {\mathbf {v}}_1,\dots ,\mathrm {\mathbf {v}}_n\}$ , let $i,j\in [n]$ and, by connectedness, choose a walk between i and j:

(2.6) $$ \begin{align} w=(i=i_0\stackrel{s_1}{\longrightarrow} i_1\stackrel{s_2}{\longrightarrow} \cdots \stackrel{s_\ell}{\longrightarrow} i_\ell=j). \end{align} $$

Let $\gamma '\in \Gamma _\ell (r,s,n)$ be the graph with ordered edge set $(s_1,\dots ,s_\ell )$ and notice that $w_i(\gamma ')=w$ , the walk described in (2.6). Let $\{r_1,\dots ,r_\ell \}\subseteq \{\rho _1,\dots ,\rho _m\}$ be the subset of reflections corresponding to the edges $\{s_1,\dots ,s_\ell \}$ , and set $\omega '=r_\ell \cdots r_1$ . By Proposition 2.9,

$$ \begin{align*} \omega'(\mathrm{\mathbf{v}}_i)=\zeta_r^k\mathrm{\mathbf{v}}_j \end{align*} $$

for some k, implying that

$$ \begin{align*} \left(\pi(r_\ell)\cdots\pi(r_1)\right)(\mathrm{\mathbf{v}}_i)=\pi(\omega'(\mathrm{\mathbf{v}}_i))=\mathrm{\mathbf{v}}_j. \end{align*} $$

Thus, the subgroup generated by $\pi (\rho _1),\dots ,\pi (\rho _m)$ acts transitively on $\{\mathrm {\mathbf {v}}_1,\dots ,\mathrm {\mathbf {v}}_n\}$ .

Conversely, assume that the subgroup generated by $\{\pi (\rho _1),\dots ,\pi (\rho _m)\}\subseteq S_n$ acts transitively on $\{\mathrm {\mathbf {v}}_1,\dots ,\mathrm {\mathbf {v}}_n\}$ . Given $i,j\in [n]$ , there is a subset $\{r_1,\dots ,r_\ell \}\subseteq \{\rho _1,\dots ,\rho _m\}$ such that

(2.7) $$ \begin{align} \left(\pi(r_\ell)\cdots\pi(r_1)\right)(\mathrm{\mathbf{v}}_i)=\mathrm{\mathbf{v}}_j. \end{align} $$

Set $\omega '=r_\ell \cdots r_1$ and let $\gamma '\in \Gamma _\ell ^{\omega '}$ be the graph associated to $(r_1,\dots ,r_\ell )\in F^{\omega '}_\ell $ . In order for (2.7) to be true, it must be the case that $\omega '(\mathrm {\mathbf {v}}_i)=\zeta _r^k\mathrm {\mathbf {v}}_j$ for some k. Therefore, by Proposition 2.9, the ordered walk $w_i(\gamma ')$ starts at vertex i and ends at vertex j. By definition, the edges of $\gamma '$ are a subset of the edges in $\gamma $ , so the ordered walk $w_i(\gamma ')$ corresponds to a (not-necessarily ordered) walk from i to j in the graph $\gamma $ . Since i and j were arbitrary, this proves that $\gamma $ is a connected graph.▪

We denote the sets of connected graphs by $\widetilde \Gamma _{m_1,m_2}\subseteq \widetilde \Gamma _m^\omega \subseteq \Gamma _m^\omega $ , and we define the connected factorization numbers by

$$ \begin{align*} \tilde f_m^\omega:=|\widetilde \Gamma_m^\omega|\;\;\text{ and }\;\;\tilde f_{m_1,m_2}^\omega:=|\widetilde \Gamma_{m_1,m_2}^\omega|. \end{align*} $$

Since every graph decomposes uniquely as a disjoint union of connected graphs, every factorization number can be computed in terms of connected factorization numbers. To make this precise, we require a little more notation. Given a subset $I\subseteq [n]$ , let $G(r,s,I)$ be the subset of $G(r,s,n)$ that fixes all standard basis vectors aside from those indexed by the elements of I. Given an element $\omega \in G(r,s,n)$ , a partition of $\omega $ consists of a set partition $[n]=I_1\sqcup \cdots \sqcup I_\ell $ along with elements $w_1\in G(r,s,I_1),\dots ,w_\ell \in G(r,s,I_\ell )$ such that $\omega _1\cdots \omega _\ell =\omega .$ If $r=1$ , then a partition of the permutation $\omega $ simply consists of all ways to group together its disjoint cycles. Let $\mathcal {P}(\omega )$ denote the set of partitions of $\omega $ . The next result describes how to compute general factorization numbers from connected factorization numbers.

Proposition 2.12 If $\omega \in G(r,s,n)$ and $m\in \mathbb {Z}_{\geq 0}$ , then

$$ \begin{align*} f_m^\omega=\sum_{\substack{(\omega_1,\dots,\omega_\ell)\in\mathcal{P}(\omega) \\ m_1+\cdots+m_\ell=m}}{m \choose m_1,\dots,m_\ell}\tilde f_{m_1}^{\omega_1}\cdots\tilde f_{m_\ell}^{\omega_\ell}. \end{align*} $$

Proof Notice that every graph $\gamma \in \Gamma _m^\omega $ can be decomposed uniquely as a disjoint union of connected graphs $\gamma _1,\dots ,\gamma _\ell $ . If $\gamma _i$ has vertices $I_i\subseteq [n]$ and has $m_i$ edges, then $\gamma _i\in \widetilde \Gamma _{m_i}^{\omega _i}$ for some $\omega _i\in G(r,s,I_i)$ . In addition, the vertex sets $\{I_i\}$ form a set partition of $[n]$ and the integers $\{m_i\}$ add up to m. Thus, there is a function

$$ \begin{align*} \Gamma_m^\omega\rightarrow\bigsqcup_{\substack{(\omega_1,\dots,\omega_\ell)\in\mathcal{P}(\omega) \\ m_1+\cdots+m_\ell=m}}\widetilde\Gamma_{m_1}^{\omega_1}\times\cdots\times \widetilde\Gamma_{m_\ell}^{\omega_\ell}. \end{align*} $$

This function is surjective, but not injective. The number of graphs in the preimage of $(\gamma _1,\dots ,\gamma _\ell )$ corresponds to the number of ways of choosing an ordering of all of the m edges that is consistent with the ordering of the $m_i$ edges in each connected component $\gamma _i$ . The number of ways of choosing such an ordering is counted by the multinomial

$$ \begin{align*} {m \choose m_1,\dots,m_\ell}, \end{align*} $$

proving the formula in the proposition.▪

3.1 Comparison formula

The next result, which is the technical heart of this paper, utilizes the homomorphisms $\pi :G(r,s,n)\rightarrow S_n$ and $\phi :G(r,s,n)\rightarrow \mu _{r/s}$ and the function $\delta :G(r,s,n)\rightarrow \{0,1\}$ to describe an explicit comparison between the connected factorization numbers $\tilde f_{m_1,m_2}^{\omega }$ associated to $\omega \in G(r,s,n)$ and the connected factorization numbers $\tilde f_{m_1}^{\pi (\omega )}$ associated to $\pi (\omega )\in S_n$ .

Theorem 3.1 For any $\omega \in G(r,s,n)$ ,

(3.1) $$ \begin{align} \tilde f_{m_1,m_2}^{\omega}=\left(r^{m_1-n+1}n^{m_2}{m_1+m_2 \choose m_1} f_{m_2}^{\phi(\omega)}\right)\tilde f_{m_1}^{\pi(\omega)}, \end{align} $$

where

(3.2) $$ \begin{align} f_{m_2}^{\phi(\omega)}=\frac{1}{r/s}\left((r/s-1)^{m_2}-(-1)^{m_2}\right)+\delta(\omega)(-1)^{m_2}. \end{align} $$

Notice that the term $f_{m_2}^{\phi (\omega )}=|F_{m_2}^{\phi (\omega )}|$ is nothing more than the number of ways to write $\phi (\omega )\in \mu _{r/s}=G(r,s,1)$ as a product of nontrivial elements in the cyclic group. Since every factorization in the cyclic group is connected, we omit the tilde from the notation.

3.2 Proof of Theorem 3.1

We begin by proving equation (3.1). When this is complete, we then turn to a proof of Equation (3.2), which follows from the computation of cyclic factorization numbers in Proposition 3.3.

To prove equation (3.1), let $\omega \in G(r,s,n)$ and consider the function

$$ \begin{align*} \pi:\widetilde\Gamma_{m_1,m_2}^\omega\rightarrow \widetilde\Gamma_{m_1}^{\pi(\omega)}, \end{align*} $$

which forgets all self-edges and edge labels. Since

$$ \begin{align*} \tilde f_{m_1,m_2}^{\omega}=|\widetilde\Gamma_{m_1,m_2}^\omega|\;\;\text{ and }\;\; \tilde f_{m_1}^{\pi(\omega)}=|\widetilde\Gamma_{m_1}^{\pi(\omega)}|, \end{align*} $$

it suffices to prove that, for any $\underline \gamma \in \widetilde \Gamma _{m_1}^{\pi (\omega )}$ , the size of its preimage under $\pi $ is given by the following formula:

(3.3) $$ \begin{align} |\pi^{-1}(\underline\gamma)|=r^{m_1-n+1}n^{m_2}{m_1+m_2 \choose m_1} f_{m_2}^{\phi(\omega)}. \end{align} $$

Let $\underline \gamma \in \widetilde \Gamma _{m_1}^{\pi (\omega )}$ ; we begin by describing the graphs $\gamma \in \pi ^{-1}(\underline \gamma )$ . Such a graph $\gamma $ has $m_1+m_2$ ordered edges E. If we forget the self-edges, then we obtain $m_1$ edges that we denote $(e_1,\dots ,e_{m_1})=E_1\preceq E$ corresponding to the $m_1$ ordered edges of $\underline \gamma $ . In addition, each edge $e_i$ has a label that we denote $k_i$ . If we forget the edges $e_1,\dots ,e_{m_1}$ , then we obtain $m_2$ ordered self-edges that we denote $(e_1',\dots ,e_{m_2}')=E_2\preceq E$ , and each self-edge $e_i'$ has a label that we denote $k_i'$ . By Proposition 2.9, the edge labels must satisfy the condition

(3.4) $$ \begin{align} \omega(\mathrm{v}_i)=\zeta_r^{\mathrm{k}(w_i)}\mathrm{v}_{\mathrm{h}(w_i)} \end{align} $$

for all $i=1,\dots ,n$ , where $w_i=w_i(\gamma )$ is the ordered edge walk starting at vertex i. Our task is to count the number of ways to choose such edges and labels subject to the constraint (3.4). Before working out the counting arguments carefully, we first summarize the three main points that will be proved.

• • The number of ways to choose the edges in $E_2$ along with the ordering $E_2\preceq E$ is

  $$ \begin{align*} n^{m_2}{m_1+m_2 \choose m_1}. \end{align*} $$

• • The number of ways to choose labels on the edges in $E_2$ is $f_{m_2}^{\phi (\omega )}$ .

• • The number of ways to choose labels on the edges in $E_1$ is $r^{m_1-n+1}$ .

We now justify each of these counts. In particular, this will prove equation (3.3), and Equation (3.1) then follows.

Let’s begin by counting the ways to choose $E_2$ . Each self-edge in $E_2$ can by attached to any one of the n nodes, which results in $n^{m_2}$ possibilities. In addition, we need to choose an inclusion $E_2\preceq E$ , which can be thought of as choosing $m_2$ places in a line-up of $m_1+m_2$ possibilities; this choice is counted by the binomial coefficient ${m_1+m_2 \choose m_1}$ . Together, the contribution of these choices to (3.3) is a factor of

$$ \begin{align*} n^{m_2}{m_1+m_2 \choose m_1}. \end{align*} $$

Now we count the number of ways to label all of the edges. Since $\phi (\omega )$ is the product of all of the nonzero entries in $\omega $ , equation (3.4) implies that the edge labels must satisfy

(3.5) $$ \begin{align} \zeta_r^{\mathrm{k}(w_1)+\cdots+\mathrm{k}(w_n)}=\phi(\omega). \end{align} $$

Since each edge $e_i\in E_1$ occurs on exactly two of the n ordered walks, once as an up-step and once as a down-step, it contributes $k_i-k_i=0$ to the exponent in (3.5). On the other hand, each self-edge $e_i'\in E_2$ occurs as a loop on exactly one walk and contributes $sk_i'$ to the exponent. Thus, the condition (3.5) is equivalent to

(3.6) $$ \begin{align} \zeta_{r/s}^{k_1'}\cdots\zeta_{r/s}^{k_{m_2}'}=\phi(\omega). \end{align} $$

In other words, the labels $k_i'$ on the self-edges must be chosen subject to the condition (3.6), and the number of ways to do this is precisely counted by $f_{m_2}^{\phi (\omega )}$ .

We have now chosen everything except for the labels $k_1,\dots ,k_{m_1}$ on the edges in $E_1$ , and it remains to prove that, given the above choices, there are exactly $r^{m_1-n+1}$ ways to choose these labels. To accomplish this, we use the following lemma.

Before proving Lemma 3.2, let’s use it to count the number of ways to choose the remaining labels $k_1,\dots ,k_{m_1}$ . Choose a specific subset of edges $\{f_1,\dots ,f_{n-1}\}\subseteq E$ and a labeling of vertices $[n]=\{v_0,\dots ,v_{n-1}\}$ satisfying the conditions of Lemma 3.2, and then consider any choice of edge labeling of the edges in $\{e_1,\dots ,e_{m_1}\}\setminus \{f_1,\dots ,f_{n-1}\}$ ; notice that there are $r^{m_1-n+1}$ such choices. Given any such choice, we now prove that there exists a unique way to label the remaining edges $f_1,\dots ,f_{n-1}$ such that (3.4) holds for all $i=1,\dots ,n$ .

First, notice that $f_{n-1}$ is the only unlabeled edge on $w_{v_{n-1}}$ . Therefore, the constraint (3.4) for $i=v_{n-1}$ uniquely determines the label on $f_{n-1}$ . After fixing the label on $f_{n-1}$ , the only possible unlabeled edge on $w_{v_{n-2}}$ is $f_{n-2}$ , so (3.4) with $i=v_{n-2}$ uniquely determines this label. Continuing this way in decreasing order, we see that the label on $f_\ell $ is uniquely determined by (3.4) with $i=v_\ell $ for all $\ell =n-1,\dots ,1$ .

The choices we made in the previous paragraph for the labels on $f_1,\dots ,f_{n-1}$ ensure that the constraint (3.4) holds for $i\in \{v_1,\dots ,v_{n-1}\}$ , but it would be natural to worry about whether the constraint also holds for $i=v_0$ . Not to fret—we know that

$$ \begin{align*} \omega(\mathrm{\mathbf{v}}_{v_0})=\zeta_r^k\mathrm{\mathbf{v}}_{\mathrm{h}(w_{v_0})} \end{align*} $$

for some k, and using the validity of (3.4) for $i\in \{v_1,\dots ,v_{n-1}\}$ along with condition (3.5), we compute that

$$ \begin{align*} \zeta_r^{k+\mathrm{k}(w_{v_1})+\cdots+\mathrm{k}(w_{v_{n-1}})}=\phi(\omega)=\zeta_r^{\mathrm{k}(w_{v_0})+\mathrm{k}(w_{v_1})+\cdots+\mathrm{k}(w_{v_{n-1}})}, \end{align*} $$

from which it follows that $\zeta _r^k=\zeta _r^{\mathrm {k}(w_{v_0})}$ , proving that (3.4) holds for $i=v_0$ . Thus, every one of the $r^{m_1-n+1}$ choices for the labels in $E_1\setminus \{f_1,\dots ,f_{n-1}\}$ can be extended uniquely to a labeling of the edges $E_1$ that satisfies (3.4), proving that the total number of ways to label the edges in $E_1$ is $r^{m_1-n+1}$ .

This concludes our counting arguments, and the only task that remains is to prove the lemma.

We have now proved equation (3.1) to finish the proof of Theorem 3.1, it therefore remains to prove equation (3.2). In the next proposition, we accomplish this by computing the cyclic factorization numbers $f_m^\kappa $ for any $\kappa \in \mu _{r}$ . This result was essentially proved by Chapuy and Stump in [Reference Chapuy and Stump3], although they only considered the case where $\kappa $ is a generator. The proof presented here is a modification of theirs.

Proposition 3.3 For any integer $r\geq 2$ and element $\kappa \in \mu _r$ ,

$$ \begin{align*} f_m^\kappa=\begin{cases} \frac{1}{r}\left((r-1)^m-(-1)^m\right), & \text{ if } \kappa\neq 1,\\ \frac{1}{r}\left((r-1)^{m}-(-1)^{m}\right)+(-1)^{m}, & \text{ if } \kappa=1. \end{cases} \end{align*} $$

Proof Choose $m-1$ nontrivial elements $\zeta _r^{k_1},\dots ,\zeta _r^{k_{m-1}}\in \mu _r$ and notice that their product $\zeta _r^{k_{m-1}}\cdots \zeta _r^{k_1}$ can be extended to a factorization of $\kappa $ into m nontrivial elements

$$ \begin{align*} \zeta_r^{k_m}\zeta_r^{k_{m-1}}\cdots\zeta_r^{k_1}=\kappa \end{align*} $$

if and only if $\zeta _r^{k_{m-1}}\cdots \zeta _r^{k_{1}}\neq \kappa $ . In other words, the number of factorizations into m nontrivial elements is the total number of products of $m-1$ nontrivial elements minus those that multiply to $\kappa $ . Thus, we obtain the following recursion:

(3.7) $$ \begin{align} f_m^\kappa=(r-1)^{m-1}-f_{m-1}^\kappa. \end{align} $$

It is straightforward to check that both of the formulas in the statement of the proposition satisfy the recursion in (3.7). The necessity for the two different formulas arises from the different initial values:

$$ \begin{align*} f_0^\kappa=\begin{cases} 0, &\text{ if } \kappa\neq 1,\\ 1, &\text{ if } \kappa=1. \end{cases} \end{align*} $$

The validity of both of these initial values can also be checked directly from the formulas appearing in the statement of the proposition.▪

3.3 Polynomiality

The polynomial structure of all factorization numbers of $G(r,s,n)$ is now a direct application of Theorem 3.1.

Theorem 3.4 Fix $r,s\in \mathbb {Z}_{>0}$ such that $s\mid r$ . For any $g,\ell \in \mathbb {Z}_{\geq 0}$ , there exist two symmetric polynomials

$$ \begin{align*} P_{g,\ell}^0,P_{g,\ell}^1\in \mathbb{Q}[x_1,\dots,x_\ell], \end{align*} $$

depending on r and s such that, if $\pi (\omega )$ has cycle type $(n_1,\dots ,n_\ell )$ and $g=\frac {1}{2}(m-n-\ell +2)$ , then

$$ \begin{align*} \tilde f_m^\omega=\frac{m!}{r^{n-1}}\prod_{i=1}^\ell \frac{n_i^{n_i+1}}{n_i!}P_{g,\ell}^{\delta(\omega)}(n_1,\dots,n_\ell). \end{align*} $$

In addition, the nonzero terms in the polynomials $P_{g,\ell }^i$ all have degrees in the interval

$$ \begin{align*} [2g-3+\ell,3g-3+\ell]. \end{align*} $$

Proof Applying Theorem 3.1, we have

$$ \begin{align*} \tilde f_m^\omega=\sum_{m_1=0}^m\left(r^{m_1-n+1}n^{m-m_1}{m \choose m_1} f_{m-m_1}^{\phi(\omega)}\right)\tilde f_{m_1}^{\pi(\omega)}. \end{align*} $$

If $\pi (\omega )$ has cycle type $(n_1,\dots ,n_\ell )$ , the ELSV formula then implies that

$$ \begin{align*} \tilde f_m^\omega=\sum_{m_1=0}^m\left(r^{m_1-n+1}n^{m-m_1}{m \choose m_1} f_{m-m_1}^{\phi(\omega)}\right)m_1!\prod_{i=1}^\ell \frac{n_i^{n_i+1}}{n_i!}P_{g(m_1),\ell}(n_1,\dots,n_\ell), \end{align*} $$

where

$$ \begin{align*} g(m_1)=\frac{1}{2}(m_1-n-\ell+2), \end{align*} $$

and the nonzero terms in $P_{g(m_1),\ell }$ have degrees in the interval

$$ \begin{align*} [2g(m_1)-3+\ell,3g(m_1)-3+\ell]. \end{align*} $$

Reorganizing terms, we see that

$$ \begin{align*} \tilde f_m^\omega=\frac{m!}{r^{n-1}}\prod_{i=1}^\ell \frac{n_i^{n_i+1}}{n_i!}\sum_{m_1=0}^m\left(r^{m_1} \frac{f_{m-m_1}^{\phi(\omega)}}{(m-m_1)!}\right)n^{m-m_1}P_{g(m_1),\ell}(n_1,\dots,n_\ell), \end{align*} $$

and we define

$$ \begin{align*} P_{g,\ell}^{\delta(\omega)}(x_1,\dots,x_\ell)=\sum_{m_1=0}^m\left(r^{m_1} \frac{f_{m-m_1}^{\phi(\omega)}}{(m-m_1)!}\right)(x_1+\cdots+x_\ell)^{m-m_1}P_{g(m_1),\ell}(x_1,\dots,x_\ell). \end{align*} $$

Observe that the degree of the nonzero terms in the $m_i$ th summand are at least

$$ \begin{align*} m-m_i+2g(m_1)-3+\ell=2g-3+\ell, \end{align*} $$

and at most

$$ \begin{align*} m-m_i+3g(m_1)-3+\ell&=m-m_1+\frac{3}{2}(m_1-n-l+2)-3+\ell\\ &\leq \frac{3}{2}(m-n-l+2)-3+\ell\\ &=3g-3+\ell, \end{align*} $$

where the inequality in the second line uses the fact that $m_1\leq m$ .▪

3.4 Generating series

For any element $\omega \in G(r,s,n)$ , define the generating series of factorizations and of connected factorizations, respectively, by

$$ \begin{align*} f^\omega(x)=\sum_{m\geq 0}f_{m}^\omega\frac{x^m}{m!} \;\; \text{ and }\;\;\tilde f^\omega(x)=\sum_{m\geq 0}\tilde f_{m}^\omega\frac{x^m}{m!}, \end{align*} $$

where x is a formal variable. The next result shows how Theorem 3.1 can be interpreted in terms of these generating series.

Corollary 3.5 For any $\omega \in G(r,s,n)$ ,

$$ \begin{align*} \tilde f^\omega(x)=\frac{1}{r^{n-1}}f^{\phi(\omega)}(nx)\tilde f^{\pi(\omega)}(rx), \end{align*} $$

where

$$ \begin{align*} f^{\phi(\omega)}(x)=\frac{1}{r/s}\left(e^{(r/s-1)x}-e^{-x} \right)+\delta(\omega)e^{-x}. \end{align*} $$

Proof Applying Theorem 3.1, we compute

$$ \begin{align*} \tilde f^\omega(x)&=\sum_{m\geq 0}\tilde f_{m}^\omega\frac{x^m}{m!}\\ &=\sum_{m_1,m_2\geq 0}\tilde f_{m_1,m_2}^\omega\frac{x^{m_1+m_2}}{(m_1+m_2)!}\\ &=\sum_{m_1,m_2\geq 0}\left(r^{m_1-n+1}n^{m_2}{m_1+m_2 \choose m_1} f_{m_2}^{\phi(\omega)}\right)\tilde f_{m_1}^{\pi(\omega)}\frac{x^{m_1+m_2}}{(m_1+m_2)!}\\ &=\frac{1}{r^{n-1}}\sum_{m_1,m_2\geq 0}\left(f_{m_2}^{\phi(\omega)}\frac{(nx)^{m_2}}{m_2!} \right)\left(\tilde f_{m_1}^{\pi(\omega)}\frac{(rx)^{m_1}}{m_1!} \right)\\ &=\frac{1}{r^{n-1}}f^{\phi(\omega)}(nx)\tilde f^{\pi(\omega)}(rx), \end{align*} $$

proving the first equation in the theorem. The second equation follows from Proposition 3.3 along with the Taylor series expression for the exponential function

$$ \begin{align*} e^x=\sum_{m\geq 0}\frac{x^m}{m!}.\\[-42pt] \end{align*} $$

▪

If $\omega \in S_n$ is a long cycle, then Jackson computed an explicit formula for the factorization series of $\omega $ in [Reference Jackson9]:

$$ \begin{align*} f^\omega(x)=\frac{1}{n!}\left(e^{x\frac{n}{2}}-e^{-x\frac{n}{2}} \right)^{n-1}. \end{align*} $$

We have omitted the tilde because all factorizations of the long cycle are connected. Using this, we obtain the following generalization to long cycles in $G(r,s,n)$ .

Corollary 3.6 If $\omega \in G(r,s,n)$ such that $\pi (\omega )$ is a long cycle, then

$$ \begin{align*} f^\omega(x)=\frac{1}{n!r^{n-1}}f^{\phi(\omega)}(nx)\left(e^{x\frac{rn}{2}}-e^{-x\frac{rn}{2}} \right)^{n-1}, \end{align*} $$

where

$$ \begin{align*} f^{\phi(\omega)}(x)=\frac{1}{r/s}\left(e^{(r/s-1)x}-e^{-x} \right)+\delta(\omega)e^{-x}. \end{align*} $$

As a special case, Corollary 3.6 recovers the main result of Chapuy and Stump [Reference Chapuy and Stump3] for the group $G(r,1,n)$ . More generally, Corollary 3.5 should be thought of as a reduction from $G(r,s,n)$ to $S_n$ —it computes an explicit formula for $\tilde f^\omega (x)$ whenever we happen to know an explicit formula for $\tilde f^{\pi (\omega )}(x)$ .