2000 character limit reached
Further solvable analogues of the Baer-Suzuki theorem and generation of nonsolvable groups
Published 11 Dec 2010 in math.GR | (1012.2480v2)
Abstract: Let $G$ be an almost simple group. We prove that if $x \in G$ has prime order $p \ge 5$, then there exists an involution $y$ such that $<x,y>$ is not solvable. Also, if $x$ is an involution then there exist three conjugates of $x$ that generate a nonsolvable group, unless $x$ belongs to a short list of exceptions, which are described explicitly. We also prove that if $x$ has order $6$ or $9$, then there exists two conjugates that generate a nonsolvable 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.