2000 character limit reached
Indecomposability of branched coverings of even degree on the projective plane (1005.0606v1)
Published 4 May 2010 in math.GT
Abstract: In this work we characterize branch data of branched coverings of even degree over the projective plane which are realizable by indecomposable branched coverings.
Sponsor
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.