2000 character limit reached
Quantitative inverse Galois problem for semicommutative finite group schemes (2210.01495v2)
Published 4 Oct 2022 in math.NT and math.AG
Abstract: A semicommutative finite group scheme is a finite group scheme which can be obtained from commutative finite group schemes by iterated performing semidirect products with commutative kernels and taking quotients by normal subgroups. In this article, for an \'etale tame semicommutative finite group scheme $G$, we give a lower bound on the number of connected $G$-torsors of bounded height (such as discriminant).
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.