On realizability of branched coverings of the sphere (Q5951981): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0166-8641(00)00094-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2022336766 / rank | |||
Normal rank |
Latest revision as of 12:07, 30 July 2024
scientific article; zbMATH DE number 1687507
Language | Label | Description | Also known as |
---|---|---|---|
English | On realizability of branched coverings of the sphere |
scientific article; zbMATH DE number 1687507 |
Statements
On realizability of branched coverings of the sphere (English)
0 references
23 November 2002
0 references
A rational branched data \(D\) of degree \(d\) is a set of integers \(d_{ij}>0\), \(j=1,\ldots,k_i\), \(i=1,\ldots,n\) satisfying the following conditions: (i) \(\forall i\) \(d_{ij}>1\) for some \(j\), (ii) \(\forall i\) \(\sum_{j=1}^{k_i}d_{ij}=d\), (iii) \(\sum_{i=1}^n \nu_i(D)=2d-2\). Here \(n=n(D)\), \(\nu_i(D)=\sum_{j=1}^{k_i}(d_{ij}-1)\), \(i=1,\ldots,n\). The classical Hurwitz problem is to determine if a given rational branched data \(D\) of degree \(d\) is realizable as the set of branched multiplicities for some \(d\)-sheeted branched covering \(f: S^2\rightarrow S^2\) with branchpoints over \(n\) given points of the sphere \(S^2\). The problem and its generalizations are investigated by A. Hurwitz, A. L. Edmonds, R. S. Kulkarni, R. E. Stong, R. Thom, G. M. Gersten, and others. The author gives some new sufficient conditions of realizability of a given data. In particular, he proved that a rational branched data is realizable provided \(n(D)\geq d\) (Theorem 12) or if for all \(i\), \(j\) the inequalities \(d_{ij}\leq 2\), \(\nu_i(D)\leq\sqrt{d/2}\) hold (Corollary 15).
0 references
surface
0 references
branched covering
0 references
Hurwitz problem
0 references
rational branched data
0 references