2000 character limit reached
Almost-Regular Dessins on a Sphere and Torus
Published 20 Sep 2017 in math.GT, math.AG, and math.GR | (1709.06869v2)
Abstract: The Hurwitz problem asks which ramification data are realizable, that is appear as the ramification type of a covering. We use dessins d'enfant to show that families of genus 1 regular ramification data with small changes are realizable with the exception of four families which were recently shown to be nonrealizable. A similar description holds in the case of genus 0 ramification data.
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.