REVIEW 1 cited by
On $\mathbb N$-Coefficient Binomial Polynomiality of Hurwitz Numbers and Generalized Dessin Counting
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In this paper, we study a certain type of Hurwitz numbers which count branched covers over the Riemann sphere admitting several branch points with fixed ramification types, one branch point with a fixed number of preimages, and one branch point with an arbitrary ramification type. We prove that the dependence of this kind of Hurwitz numbers on parts of the ramification type over the last point is a polynomial. Moreover, when expanding this polynomial in terms of products of binomial coefficients, we show that the coefficients are always non-negative integers via a pure combinatorial method. Our result generalizes the polynomiality in several models, including the one-part double Hurwitz numbers studied by Goulden-Jackson-Vakil, the one-part double Hurwitz numbers with completed cycles studied by Shadrin-Spitz-Zvonkine, and the generalized dessin counting.
Forward citations
Cited by 1 Pith paper
-
Nonlinear port-Hamiltonian system identification from input-state-output data
A structure-preserving neural network method identifies nonlinear port-Hamiltonian systems from input-state-output data, improving long-term forecasting over physics-free baselines.
Discussion (0). Continue with ORCID to comment.