Generating finite simple groups with $2$ elements - MathOverflow most recent 30 from http://mathoverflow.net 2013-05-25T00:38:34Z http://mathoverflow.net/feeds/question/59213 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/59213/generating-finite-simple-groups-with-2-elements Generating finite simple groups with $2$ elements Hugo Chapdelaine 2011-03-22T18:09:22Z 2012-08-26T06:29:43Z <p>Here is a very natural question:</p> <p>Q: Is it always possible to generate a finite simple group with only $2$ elements?</p> <p>In all the examples that I can think of the answer is yes.</p> <p>If the answer is positive, how does one prove it? Is it possible to prove it without using the classification of finite simple groups?</p> http://mathoverflow.net/questions/59213/generating-finite-simple-groups-with-2-elements/59214#59214 Answer by Todd Trimble for Generating finite simple groups with $2$ elements Todd Trimble 2011-03-22T18:15:16Z 2011-03-22T18:15:16Z <p>Yes. See <a href="http://www.math.niu.edu/~rusin/known-math/98/2generators" rel="nofollow">this</a>. </p> http://mathoverflow.net/questions/59213/generating-finite-simple-groups-with-2-elements/59216#59216 Answer by Yiftach Barnea for Generating finite simple groups with $2$ elements Yiftach Barnea 2011-03-22T18:19:57Z 2011-04-18T22:34:54Z <p>The answer to your question is yes. Moreover, if you pick two random elements from a finite simple group, then they generate the whole group with probability which tends to 1 as the size of the group grows. There are even stronger results in this direction, but I am not an expert in the subject so you will have to look for it yourself. You should look for papers by Liebek and Shalev, Lubotzky, Kantor, and there are others who I am not sure about now. </p> <p>All of these results require the classification. There are very few results regarding finite simple groups which do not require the classification.</p> <p>Edit: here is a link to a fairly old survay paper in the notices: <a href="http://www.ams.org/notices/200104/fea-shalev.pdf" rel="nofollow">http://www.ams.org/notices/200104/fea-shalev.pdf</a>. There are many new developments in the last decade. </p> http://mathoverflow.net/questions/59213/generating-finite-simple-groups-with-2-elements/59287#59287 Answer by F. Ladisch for Generating finite simple groups with $2$ elements F. Ladisch 2011-03-23T11:18:31Z 2011-03-23T11:18:31Z <p>In addition to the two answers already given it might be worth to mention that the generating graph of a finite simple group has no isolated vertices: This means that for every nonidentity element $x\in G$, there is some other element $y$ such that $G=\langle x, y\rangle$. (The generating graph of a group has the nonidentity elements of $G$ as vertices, where to vertices are connected if they generate the group.) This is shown in</p> <blockquote> <p>Guralnick, Robert, Kantor, William, <em><a href="http://dx.doi.org/10.1006/jabr.2000.8357" rel="nofollow">Probalistic generation of finite simple groups</a></em>, J. Algebra 234 (2000), p. 743–792. (<a href="http://www.ams.org/mathscinet-getitem?mr=1800754" rel="nofollow">MR1800754</a>) </p> </blockquote> <p>Recently, Breuer et. al. have shown that the generating graph of every "sufficiently large" finite simple group contains a Hamiltonian cycle. You might also look at the references given in their paper:</p> <blockquote> <p>Breuer, T., Guralnick, R. M., Lucchini, A., Maróti, A., Nagy, G. P., <em><a href="http://dx.doi.org/10.1112/blms/bdq017" rel="nofollow">Hamiltonian cycles in the generating graphs of finite groups</a></em>, Bull. Lond. Math. Soc. 42 (2010), p. 621–633. (<a href="http://www.ams.org/mathscinet-getitem?mr=2669683" rel="nofollow">MR2669683</a>)</p> </blockquote> http://mathoverflow.net/questions/59213/generating-finite-simple-groups-with-2-elements/59300#59300 Answer by Pete L. Clark for Generating finite simple groups with $2$ elements Pete L. Clark 2011-03-23T13:46:55Z 2012-08-26T06:29:43Z <p>Since I happen to know the OP is number-theoretically inclined, let me add the following remark:</p> <p>For "most" finite simple groups $G$ it is indeed the case that $G = \langle x, y \rangle$ where $x$ has order $2$ and $y$ has order $3$. Equivalently, $G$ is a quotient of the free product $\mathbb{Z}/2\mathbb{Z} * \mathbb{Z}/3\mathbb{Z} \cong \operatorname{PSL}_2(\mathbb{Z}) = \Gamma(1)$. </p> <p>This has the following geometric consequence: there is some subgroup $\Gamma_G \subset \Gamma(1)$ such that $X_G = \Gamma_G \backslash \overline{\mathcal{H}}$ is a modular curve and $X_G \rightarrow X(1) \cong \mathbb{P}^1$ is a $G$-Galois branched covering. By taking $G$ to be something else than $\operatorname{PSL}_2(\mathbb{Z}/p\mathbb{Z})$ one sees that $\Gamma(1)$ admits many <strong>non-congruence subgroups</strong>. For instance, it is well-known (<b>added</b>: I should have said "a well-known theorem of J.G. Thompson") that one can take $G$ to be the <a href="http://en.wikipedia.org/wiki/Monster_group" rel="nofollow">Fischer-Griess Monster</a>.</p> <p>I don't want to make precise what I mean by "most". Note that there are infinitely many finite simple groups with order prime to $3$ (although one has to look fairly far down the list of all finite simple groups to see them: <strong>Suzuki groups</strong>), so I definitely do not mean "all but finitely many". </p> http://mathoverflow.net/questions/59213/generating-finite-simple-groups-with-2-elements/94260#94260 Answer by P Vanchinathan for Generating finite simple groups with $2$ elements P Vanchinathan 2012-04-16T23:57:43Z 2012-04-16T23:57:43Z <p>There is a paper in arxiv by Robert Guralnick and Gunter Malle that answers your question in a stronger way. Their aim is to prove existence of algebraic surfaces obtained in a specific way as a quotient of finite group actions on products of curves of genus > 1. They prove the existence of two conjugacy classes in a finite simple group with the property that picking one element each from these classes always generates the group.</p> <p>Here is the link:</p> <p><a href="http://arxiv.org/abs/1009.6183" rel="nofollow">http://arxiv.org/abs/1009.6183</a></p>