English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

.  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 conditions on the cycle types of the factors, such as minimality and transitivity.  Goulden and Jackson have given a proof for the number of minimal, transitive factorizations of a permutation into transpositions. This proof involves a partial differential equation for the generating series, called the Join-Cut equation. Recently, Bousquet-Mlou and Schaeffer have found the number of minimal, transitive factorizations of a permutation into arbitrary unspecified factors. This was proved by a purely combinatorial argument, based on a direct bijection between factorizations and certain objects called m-Eulerian trees.    In this paper, we give a simple partial differential equation for Bousquet-Mlou and Schaeffer’s generating series, and for Goulden and Jackson’s generating series, as well as a new proof of the result by Bousquet-Mlou and Schaeffer. We apply algebraic methods based on Lagrange’s theorem, and combinatorial methods based on a new use of Bousquet-Mlou and Schaeffer’s m-Eulerian trees.

A Simple Recurrence for Covers of the Sphere With Branch Points of Arbitrary Ramification