2000 character limit reached
Spherical conic metrics and realizability of branched covers (1805.03312v3)
Published 8 May 2018 in math.GT and math.DG
Abstract: Branched covers between Riemann surfaces are associated with certain combinatorial data, and Hurwitz existence problem asks whether given data satisfying those combinatorial constraints can be realized by some branched cover. We connect recent development in spherical conic metrics to this old problem, and give a new method of finding exceptional (unrealizable) branching data. As an application, we find new infinite sets of exceptional branched cover data on the Riemann sphere.
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.