2018
DOI: 10.4171/cmh/440
|View full text |Cite
|
Sign up to set email alerts
|

Hurwitz numbers for real polynomials

Abstract: We consider the problem of defining and computing real analogs of polynomial Hurwitz numbers, in other words, the problem of counting properly normalized real polynomials with fixed ramification profiles over real branch points. We show that, provided the polynomials are counted with an appropriate sign, their number does not depend on the order of the branch points on the real line. We study generating series for the invariants thus obtained, determine necessary and sufficient conditions for the vanishing and… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(14 citation statements)
references
References 13 publications
0
13
0
1
Order By: Relevance
“…Hurwitz numbers are a widely studied subject, seen as central to combinatorial algebraic geometry. For basics see [4,5,15,20,23] and the references therein.…”
Section: Hurwitz Combinatoricsmentioning
confidence: 99%
See 1 more Smart Citation
“…Hurwitz numbers are a widely studied subject, seen as central to combinatorial algebraic geometry. For basics see [4,5,15,20,23] and the references therein.…”
Section: Hurwitz Combinatoricsmentioning
confidence: 99%
“…We now turn to branched covers that are real. In the abstract setting of Hurwitz numbers H d , this has been studied in [3,15,20]. A cover f : C → P 1 is called real if the Riemann surface C has an involution which is compatible with complex conjugation on the Riemann sphere P 1 .…”
Section: Type Real?mentioning
confidence: 99%
“…This method is also valid in the study of counting covers. Itenberg and Zvonkine [13] found such a signed count of real polynomials Date: October 5, 2020. 2010 Mathematics Subject Classification.…”
Section: Introductionmentioning
confidence: 97%
“…This is consistent with the best known results for Welschinger invariants and the Hurwitz-type counts of polynomials and rational functions mentioned before. For better comparison, let us recall the main asymptotic statements from [IZ16;ER17]. Let S pol (λ 1 , .…”
Section: Introductionmentioning
confidence: 99%
“…x−p , f ∈ R[x], p ∈ R, respectively, with prescribed critical levels and ramification profiles as defined in [IZ16;ER17]. Set s pol (m) = S pol ((λ 1 , 1 2m ), .…”
Section: Introductionmentioning
confidence: 99%