Related papers: Hurwitz numbers for real polynomials

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

The Welschinger numbers, a kind of a real analog of the Gromov-Witten numbers which count the complex rational curves through a given generic collection of points, bound from below the number of real rational curves for any real generic…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

This article focuses on automatically generating polynomial equations that are inductive loop invariants of computer programs. We propose a new algorithm for this task, which is based on polynomial interpolation. Though the proposed…

We define real origami (that is, origami equipped with a real structure) and enumerate them using the combinatorics of zonal polynomials. We explicitly express in terms of sums of divisors the numbers of genus 2 real origami with 2 simple…

We determine the asymptotic behavior of the coefficients of Hecke polynomials. In particular, this allows us to determine signs of these coefficients when the level or the weight is sufficiently large. In all but finitely many cases, this…

Double Hurwitz numbers enumerating weighted $n$-sheeted branched coverings of the Riemann sphere or, equivalently, weighted paths in the Cayley graph of $S_n$ generated by transpositions are determined by an associated weight generating…

In this paper we study prime and maximal ideals in a Hurwitz polynomial ring hR. It is well-known that to study many questions we may assume R is prime and consider just R-disjoint ideals. We give a characterization for an R-disjoint ideal…

A difference equation analogue of the Knizhnik-Zamolodchikov equation is exhibited by developing a theory of the generating function $H(z)$ of Hurwitz polyzeta functions to parallel that of the polylogarithms. By emulating the role of the…

A direct relation between the enumeration of ordinary maps and that of fully simple maps first appeared in the work of the first and last authors. The relation is via monotone Hurwitz numbers and was originally proved using Weingarten…

We study and compute an infinite family of Hurwitz spaces parameterizing covers of P_C branched at four points and deduce explicit regular S_n and A_n-extensions over Q(T) with totally real fibers.

We show that a polynomial equation of degree less than 5 and with real parameters can be solved by regarding the variable in which the polynomial depends as a complex variable. For do it so, we only have to separate the real and imaginary…

We develop a Hurwitz stability criterion for nonmonic matrix polynomials via column reduction, generalizing existing approaches constrained by the monic assumption and thus serving as a more natural extension of Gantmacher's classical…

In this short note we prove a couple of facts about polynomial count varieties, answering natural questions that they raise. A polynomial count $X$ variety is essentially one for which its number of points over finite fields is given by a…

Polynomial-in-time algorithms for computing classical Hurwitz numbers were given in [4] based on the Pandharipande equation. The paritition function of double Hurwitz numbers was proved [21] to satisfy the 2-Toda hierarchy. In this paper,…

To a branched cover f between orientable surfaces one can associate a certain branch datum D(f), that encodes the combinatorics of the cover. This D(f) satisfies a compatibility condition called the Riemann-Hurwitz relation. The old but…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

We introduce a natural structure of a semigroup (isomorphic to a factorization semigroup of the unity in the symmetric group) on the set of irreducible components of Hurwitz space of marked degree $d$ coverings of $\mathbb P^1$ of fixed…

Ekedahl, Lando, Shapiro, and Vainshtein announced a remarkable formula expressing Hurwitz numbers (counting covers of the projective line with specified simple branch points, and specified branching over one other point) in terms of Hodge…