Quantitative inverse Galois problem for semicommutative finite group schemes
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).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.