Decomposability problem on branched coverings
From MaRDI portal
Publication:3085154
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.
Recommendations
- Decomposition tree and indecomposable coverings
- On proper branched coverings and a question of Vuorinen
- An intrinsic characterization of branched coverings
- Degenerating families of finite branched coverings
- Algorithmic aspects of branched coverings
- On the nonexistence of certain branched covers
- scientific article; zbMATH DE number 1230615
- scientific article; zbMATH DE number 1237933
- Survey on decomposition of multiple coverings
- Obstructions to branch-decomposition of matroids
Cited in
(5)
This page was built for publication: Decomposability problem on branched coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085154)