Related papers: A simple recurrence for covers of the sphere with …
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz numbers essentially count irreducible genus g covers of the sphere, with…
We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…
We study the asymptotic behaviour of random factorizations of the $n$-cycle into transpositions of fixed genus $g>0$. They have a geometric interpretation as branched covers of the sphere and their enumeration as Hurwitz numbers was…
We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…
We obtain an explicit expression for the number of ramified coverings of the sphere by the torus with given ramification type for a small number of ramification points, and conjecture this to be true for an arbitrary number of ramification…
We give two combinatorial proofs of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number…
Using Traizet's regeneration method, we prove the existence of many new 3-dimensional families of embedded, doubly periodic minimal surfaces. All these families have a foliation of 3-dimensional Euclidean space by vertical planes as a…
Hurwitz numbers enumerate branched morphisms between Riemannn surfaces with fixed numerical data. They represent important objects in enumerative geometry that are accessible by combinatorial techniques. In the past decade, many variants of…
We study random typical minimal factorizations of the $n$-cycle, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions, chosen uniformly at random. Our main result is, roughly speaking, a local convergence theorem…
Buryak, Feigin and Nakajima computed a generating function for a family of partition statistics by using the geometry of the $Z/cZ$ fixed point sets in the Hilbert scheme of points on $C^2$. Loehr and Warrington had already shown how a…
An explicit expression is obtained for the generating series for the number of ramified coverings of the sphere by the torus, with elementary branch points and prescribed ramification type over infinity. This proves a conjecture of Goulden,…
In this paper, we study factorizations of cycles. The main result is that under certain condition, the number of ways to factor a $d$-cycle into a product of cycles of prescribed lengths is $d^{r-2}.$ To prove our result, we first define a…
The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…
We consider the problem of when one quandle homomorphism will factor through another, restricting our attention to the case where all quandles involved are connected. We provide a complete solution to the problem for surjective quandle…
Simple Hurwitz numbers enumerate branched morphisms between Riemann surfaces with fixed ramification data. In recent years, several variants of this notion for genus $0$ base curves have appeared in the literature. Among them are so-called…
The classical Hurwitz numbers count the fixed-length transitive transposition factorizations of a permutation, with a remarkable product formula for the case of minimum length (genus $0$). We study the analogue of these numbers for…
A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We study the factorizations of the permutation $(1,2,...,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of…