Related papers: Hurwitz numbers for reflection groups I: Generatin…

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

In a finite real reflection group, two factorizations of a Coxeter element into an arbitrary number of reflections are shown to lie in the same orbit under the Hurwitz action if and only if they use the same multiset of conjugacy classes.…

This paper continues previous work, based on systematic use of a formula of L. Scott, to detect Hurwitz groups. It closes the problem of determining the finite simple groups contained in $PGL_n(F)$ for $n\leq 7$ which are Hurwitz, where $F$…

In [11] we showed that a loop in a simply connected compact Lie group $\dot{U}$ has a unique Birkhoff (or triangular) factorization if and only if the loop has a unique root subgroup factorization (relative to a choice of a reduced sequence…

We give an intrinsic criterion to tell whether a reflection factorization in the general linear group is reduced, and give a formula for computing reflection length in the general affine group.

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We describe an approach, via Malle's permutation $\Psi$ on the set of irreducible characters $\text{Irr}(W)$, that gives a uniform derivation of the Chapuy-Stump formula for the enumeration of reflection factorizations of the Coxeter…

We study normal reflection subgroups of complex reflection groups. Our approach leads to a refinement of a theorem of Orlik and Solomon to the effect that the generating function for fixed-space dimension over a reflection group is a…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…

Going beyond the studies of single and double Hurwitz numbers, we report some progress towards studying Hurwitz numbers which correspond to ramified coverings of the Riemann sphere involving three nonsimple branch points. We first prove a…

Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…

We count factorizations of Singer cycles as products of reflections in the families of special and general unitary and linear groups over a finite field. In the case of minimum-length factorizations, the resulting answer is a striking…

The basis elements spanning the Sato Grassmannian element corresponding to the KP $\tau$-function that serves as generating function for rationally weighted Hurwitz numbers are shown to be Meijer $G$-functions. Using their Mellin-Barnes…

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain…

We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer…

In this paper, we introduce a kind of decomposition of a finite group called a uniform group factorization, as a generalization of exact factorizations of a finite group. A group $G$ is said to admit a uniform group factorization if there…

Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…

In combinatorics on words, the well-studied factor complexity function $\rho_{\infw{x}}$ of a sequence $\infw{x}$ over a finite alphabet counts, for every nonnegative integer $n$, the number of distinct length-$n$ factors of $\infw{x}$. In…

For a positively presented group G, we provide a criterion for two tuples of positive group generators of G to be Hurwitz equivalent or Hurwitz-conjugation equivalent. We also present an algorithmic approach to solve the Hurwitz equivalence…