2000 character limit reached
Monodromy groups of indecomposable coverings of bounded genus
Published 25 Mar 2024 in math.AG, math.GR, and math.NT | (2403.17167v1)
Abstract: For each nonnegative integer , we classify the ramification types and monodromy groups of indecomposable coverings of complex curves where has genus , under the hypothesis that is sufficiently large and the monodromy group is not or . This proves a conjecture of Guralnick and several conjectures of Guralnick and Shareshian.
Paper Prompts
Sign up for free to create and run prompts on this paper.