2000 character limit reached
Monodromy representations of completed coverings
Published 25 Jun 2014 in math.GT | (1406.6484v1)
Abstract: In this paper we consider completed coverings that are branched coverings in the sense of Fox. For completed coverings between PL manifolds we give a characterization of the existence of a monodromy representation and the existence of a locally compact monodromy representation. These results stem from a characterization for the discreteness of a completed normal covering. We also show that completed coverings admitting a monodromy representations are discrete and that the image of the branch set is closed.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.