Decomposability problem on branched coverings
Geometric Topology
2010-05-11 v4
Abstract
Given a branched covering of degree d between closed surfaces, it determines a collection of partitions of d, the branch data. In this work we show that any branch data are realized by an indecomposable primitive branched covering on a connected close surface N with Euler's characteristic less than or equal to 0. This shows that decomposable and indecomposable realizations may coexist. Moreover, we characterize the branch data of a decomposable primitive branched covering.
Cite
@article{arxiv.0707.2949,
title = {Decomposability problem on branched coverings},
author = {Natalia A. Viana Bedoya and Daciberg Lima Goncalves},
journal= {arXiv preprint arXiv:0707.2949},
year = {2010}
}
Comments
19 pages. In this new version we improved the proofs and the presentation of the work.