Enumeration of almost polynomial rational functions with given critical values

DOI10.1016/J.EJC.2007.02.015MaRDI QIDQ2472841zbMATH OpenOpenAlexWikidataFDO

Authors Dmitri Panov, Dimitri Zvonkine

Publication date 25 February 2008

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0504588

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Geometric function theory (30C99)

Abstract: Enumerating ramified coverings of the sphere with fixed ramification types is a well-known problem first considered by A. Hurwitz. Up to now, explicit solutions have been obtained only for some families of ramified coverings, for instant, those realized by polynomials in one complex variable. In this paper we obtain an explicit answer for a large new family of coverings, namely, the coverings realized by simple almost polynomials, defined below. Unlike most other results in the field, our formula is obtained by elementary methods.

Review text

A rational function \(f: \mathbb{C}\to \mathbb{C}\) is said to be simple if every critical value has exactly one critical preimage; it is said to be almost polynomial if the sum of the orders of its poles is smaller than the degree of each critical point. The authors find the number of simple almost polynomial rational functions with fixed orders of poles and fixed critical values of fixed degrees. This problem was first considered by \textit{V. I. Arnold} [Funct. Anal. Appl. 30, No. 1, 1--14 (1996); translation from Funkts. Anal. Prilozh. 30, No. 1, 1--17 (1996; Zbl 0898.32019)].

Recommendations

• scientific article; zbMATH DE number 1066473
• Signed counts of real simple rational functions
• Branched coverings of riemann surfaces whose branch orders coincide with the multiplicity
• The number of ramified covering of a Riemann surface by Riemann surface
• Uniformization of simply connected ramified coverings of the sphere by rational functions

Cites work

• Factoring \(n\)-cycles and counting maps of given genus
• Hurwitz numbers and intersections on moduli spaces of curves.
• On multiplicities of the Lyashko-Looijenga mapping on discriminant strata
• Plane and projective meanders
• The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group
• The Gromov-Witten potential of a point, Hurwitz numbers, and Hodge integrals.
• Topological classification of trigonometric polynomials and combinatorics of graphs with an equal number of vertices and edges
• Towards the geometry of double Hurwitz numbers

Cited in

(8)

• Cycle factorizations and 1-faced graph embeddings
• Uniformization of simply-connected ramified coverings of the sphere by rational functions
• Rational functions with prescribed critical points.
• scientific article; zbMATH DE number 999596 (Why is no real title available?)
• scientific article; zbMATH DE number 1066473 (Why is no real title available?)
• scientific article; zbMATH DE number 2020260 (Why is no real title available?)
• Uniformization of simply connected ramified coverings of the sphere by rational functions
• Catalan numbers and branched coverings by the Riemann sphere

This page was built for publication: Enumeration of almost polynomial rational functions with given critical values

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2472841)