Let e and be closed, connected, and orientable surfaces, and let f: e ! be a branched cover. For each branching point x 2 the set of local degrees of f at f1(x) is a partition of the total degree d. The total length of the various partitions is determined by (e), (), d and the number of branching points via the Riemann-Hurwitz formula. A very old problem asks whether a collection of partitions of d having the appropriate total length (that we call a candidate cover) always comes from some branched cover. The answer is known to be in the armative whenever is not the 2-sphere S, while for = S exceptions do occur. A long-standing conjecture however asserts that when the degree d is a prime number a candidate cover is always realizable...
Given a branched covering of degree d between closed surfaces, it determines a collection of partiti...
The paper is concerned with the realizability problem of branched coverings of S-2, namely, given a ...
The Hurwitz existence problem asks what branching data can actually be realized by a branched coveri...
To a branched cover between closed, connected and orientable surfaces one associates a "branch datum...
For a given branched covering between closed connected surfaces, there are several easy relations on...
For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy nec...
For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy nec...
none2noTo a branched cover f between orientable surfaces one can associate a certain branch datum D(...
To a branched cover $f$ between orientable surfaces one can associate a certain emph{branch datum} $...
To a branched cover $f$ between orientable surfaces one can associate a certain emph{branch datum} $...
AbstractFrom some new Hurwitz like classification and existence theorems for branched coverings of s...
From some new Hurwitz like classification and existence theorems for branched coverings of surfaces,...
Given a branched covering φ: M − → N of degree d between closed connected surfaces, it determines a ...
This thesis deals with the realizability problem of branched coverings between surfaces proposed by ...
Given a branched covering of degree d between closed surfaces, it determines a collection of partiti...
Given a branched covering of degree d between closed surfaces, it determines a collection of partiti...
The paper is concerned with the realizability problem of branched coverings of S-2, namely, given a ...
The Hurwitz existence problem asks what branching data can actually be realized by a branched coveri...
To a branched cover between closed, connected and orientable surfaces one associates a "branch datum...
For a given branched covering between closed connected surfaces, there are several easy relations on...
For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy nec...
For the existence of a branched covering Sigma~ --> Sigma between closed surfaces there are easy nec...
none2noTo a branched cover f between orientable surfaces one can associate a certain branch datum D(...
To a branched cover $f$ between orientable surfaces one can associate a certain emph{branch datum} $...
To a branched cover $f$ between orientable surfaces one can associate a certain emph{branch datum} $...
AbstractFrom some new Hurwitz like classification and existence theorems for branched coverings of s...
From some new Hurwitz like classification and existence theorems for branched coverings of surfaces,...
Given a branched covering φ: M − → N of degree d between closed connected surfaces, it determines a ...
This thesis deals with the realizability problem of branched coverings between surfaces proposed by ...
Given a branched covering of degree d between closed surfaces, it determines a collection of partiti...
Given a branched covering of degree d between closed surfaces, it determines a collection of partiti...
The paper is concerned with the realizability problem of branched coverings of S-2, namely, given a ...
The Hurwitz existence problem asks what branching data can actually be realized by a branched coveri...