2000 character limit reached
Set-stabilizers in solvable permutation groups
Published 23 Dec 2024 in math.GR | (2412.17976v2)
Abstract: Let G be a finite solvable permutation group. Then modulo a possibly trivial normal elementary abelian 3-subgroup, some set-stabilizer in G is a 2-group.
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.