|
This article is cited in 2 scientific papers (total in 2 papers)
Decomposability problem on branched coverings
N. A. V. Bedoyaa, D. L. Gonçalvesb a Universidade Federal de São Carlos
b Universidade de São Paulo
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 closed surface $N$ with $\chi(N) \leq 0$. This shows that decomposable and indecomposable realizations may coexist. Moreover, we characterize the branch data of a decomposable primitive branched covering.
Bibliography: 20 titles.
Keywords:
branched coverings, permutation groups.
Received: 27.04.2009 and 17.04.2010
Citation:
N. A. V. Bedoya, D. L. Gonçalves, “Decomposability problem on branched coverings”, Sb. Math., 201:12 (2010), 1715–1730
Linking options:
https://www.mathnet.ru/eng/sm7572https://doi.org/10.1070/SM2010v201n12ABEH004128 https://www.mathnet.ru/eng/sm/v201/i12/p3
|
Statistics & downloads: |
Abstract page: | 563 | Russian version PDF: | 184 | English version PDF: | 13 | References: | 48 | First page: | 41 |
|