On $\mathbb N$-Coefficient Binomial Polynomiality of Hurwitz Numbers and Generalized Dessin Counting
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916738846687232 |
|---|---|
| author | Wang, Zhiyuan Yang, Chenglang |
| author_facet | Wang, Zhiyuan Yang, Chenglang |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_03212 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On $\mathbb N$-Coefficient Binomial Polynomiality of Hurwitz Numbers and Generalized Dessin Counting Wang, Zhiyuan Yang, Chenglang Combinatorics Mathematical Physics Representation Theory Exactly Solvable and Integrable Systems 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. |
| title | On $\mathbb N$-Coefficient Binomial Polynomiality of Hurwitz Numbers and Generalized Dessin Counting |
| topic | Combinatorics Mathematical Physics Representation Theory Exactly Solvable and Integrable Systems |
| url | https://arxiv.org/abs/2408.03212 |