Jekyll2019-09-06T11:15:59+00:00https://nickpgill.github.io/feed.xmlNick GillGroups and Geometries 20192019-09-06T00:00:00+00:002019-09-06T00:00:00+00:00https://nickpgill.github.io/groups-and-geometries-2019<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'],
inlineMath: [['$','$']]
}
});
</script>
<script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script>
<p>I just got back from a conference at <a href="http://www.birs.ca">Banff International Research Station</a> on “Groups and Geometries”. Many thanks to Martin Liebeck, Inna Capdebosq and Bernhard Muehlherr for organising a brilliant week.</p>
<p>I gave a talk at the conference entitled “The relational complexity of a finite primitive permutation group”, which you can view by clicking <a href="http://www.birs.ca/events/2019/5-day-workshops/19w5046/videos/embed/201908261531-Gill.mp4">here</a>. The abstract of the talk was the following:</p>
<blockquote>
<p>Motivated by questions in model theory, Greg Cherlin introduced the idea of “relational
complexity”, a statistic connected to finite permutation groups. He also stated a conjecture
classifying those permutation groups with minimal relational complexity. We report on recent
progress towards a proof of this conjecture. We also make some remarks about permutation
groups with large relational complexity, and we explain how this statistic relates to others in the literature, notably base-size.</p>
<p>This work is joint with Pablo Spiga, Martin Liebeck, Francesca Dalla Volta, Francis Hunt and Bianca Lodà.”</p>
</blockquote>
<p><strong>Erratum</strong>: at minute 39 of the talk I mis-stated a theorem. The correct statement is as follows:</p>
<p><strong>Theorem</strong> (Gill, Lodà, Spiga) There exists a constant $c$ such that if $G$ acts primitively on a set $X$ of size $t$, then either</p>
<ol>
<li>$H(G,X) < c {\rm log} t$</li>
<li>$G$ is a subgroup of $S_m \wr S_r$ containing $(A_m)^r$, where the action of $S_m$ is on $k$-element subsets of ${1, …, m}$ and the wreath product has the product action of degree $t={m \choose k}^r$.</li>
</ol>nickgillI just got back from a conference at Banff International Research Station on “Groups and Geometries”. Many thanks to Martin Liebeck, Inna Capdebosq and Bernhard Muehlherr for organising a brilliant week. I gave a talk at the conference entitled “The relational complexity of a finite primitive permutation group”, which you can view by clicking here. The abstract of the talk was the following: Motivated by questions in model theory, Greg Cherlin introduced the idea of “relational complexity”, a statistic connected to finite permutation groups. He also stated a conjecture classifying those permutation groups with minimal relational complexity. We report on recent progress towards a proof of this conjecture. We also make some remarks about permutation groups with large relational complexity, and we explain how this statistic relates to others in the literature, notably base-size. This work is joint with Pablo Spiga, Martin Liebeck, Francesca Dalla Volta, Francis Hunt and Bianca Lodà.” Erratum: at minute 39 of the talk I mis-stated a theorem. The correct statement is as follows: Theorem (Gill, Lodà, Spiga) There exists a constant $c$ such that if $G$ acts primitively on a set $X$ of size $t$, then either $H(G,X) < c {\rm log} t$ $G$ is a subgroup of $S_m \wr S_r$ containing $(A_m)^r$, where the action of $S_m$ is on $k$-element subsets of ${1, …, m}$ and the wreath product has the product action of degree $t={m \choose k}^r$.Maximal tori of groups of Lie type2019-07-11T00:00:00+00:002019-07-11T00:00:00+00:00https://nickpgill.github.io/maximal-tori-of-groups-of-Lie-type<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'],
inlineMath: [['$','$']]
}
});
</script>
<script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script>
<p>I’ve been re-reading parts of Carter’s “Finite groups of Lie type” and Malle-Testerman’s “Linear algebraic groups and finite groups of Lie type” with a view to understanding the theory of maximal tori in finite groups of Lie type.</p>
<p>In this post I want to use the theory in those books to write down the orders of the maximal tori of $A_2(q)$, ${^2A_2(q)}$ and $G_2(q)$. I wanted to also do ${^2G_2(q)}$ but, so far, I haven’t managed to write things down properly for the Ree and Suzuki groups, so I’ll exclude these from what follows.</p>
<p>The general set-up is as follows: $G$ is a simple linear algebraic groups, and $F:G\to G$ is a Steinberg endomorphism, i.e. some power $F^m:G\to G$ is a Frobenius endomorphism of $G$. (Some of this theory works more generally – for $G$ connected reductive – and, in particular, this can be important when one studies centralizers inside a simple LAG’s…. But I’m not going there just now.) Now a theorem of Steinberg asserts that $G^F$, the set of fixed-points of $F$, is a finite set [MT, Theorem 21.5] – such a group is an example of a <strong>finite group of Lie type</strong>.</p>
<p>Now the Lang-Steinberg theorem asserts that the map $L:G\to G, \, g\mapsto F(g) g^{-1}$ is surjective [MT, Theorem 21.7]. This theorem then implies that $G$ contains an $F$-stable maximal torus $T$ inside an $F$-stable Borel subgroup $B$. Since $T$ is $F$-stable, $N_G(T)$ is also $F$-stable, and so $F$ naturally acts on the Weyl group $W=N_G(T)/T$ of $G$. Similarly, $F$ acts on the character group $X:=X(T)$ via</p>
<script type="math/tex; mode=display">F(\chi(t)):= \chi(F(t)) \textrm{ for } \chi \in X, t\in T.</script>
<p>We will need the notion of $F$-conjugacy in $W$: if $w_1, w_2\in W$, then $w_1$ is <strong>$F$-conjugate</strong> with $w_2$ if there exists $g\in W$ such that $w_1=F(g)w_2g^{-1}$.</p>
<p>Let $\Phi\subset X$ be the root system of $G$ with positive system $\Phi^+$ with respect to $T$ and $B$. In what follows we write $X_\mathbb{R}:=X\otimes_{\mathbb{Z}}\mathbb{R}$.</p>
<p>Now the first three results of [MT, Section 22.1] imply that</p>
<ul>
<li>there exists a natural number $\delta$ such that $F^\delta=r.1$ in its action on $X$, where $r$ is some power of $p$;</li>
<li>there exists a permutation $\rho$ of $\Phi^+$ such that, for each $\alpha\in\Phi^+$, $F(\rho(\alpha)) = q_\alpha \alpha$ where $q_\alpha>1$ is a power of $p$;</li>
<li>the parameter $q_\alpha$ is constant on root lengths; moreover, either $q_\alpha=q$ or else $(G,p)\in{(B_2,2), (G_2,3), (F_4,2)}$, $\rho$ interchanges long and short roots, and $q_{long}.q_{short}=q^2$ with $q_{short}/q_{long}=p$;</li>
<li>setting $q=r^{1/\delta}$, we have that $F=q\phi$, where $q$ is the Frobenius endomorphism, and $\phi\in {\rm Aut}(X_\mathbb{R})$ is of order $\delta$ inducing $\rho^{-1}$ on $\Phi^+$;</li>
<li>$T^F=X/(F-1)/X$.</li>
</ul>
<p>It is important to note that, in principle, $q$ is a fractional power of $p$ (although, in fact, it will be integral except when $G^F$ is Ree or Suzuki). Note, too, that this set-up clearly defines the real number $q$ to be associated to our finite group of Lie type – for certain families (e.g. the unitaries), the value of $q$ follows varying conventions whereas here it is clear cut.</p>
<p>We have set-up all the necessary parameters associated with our group of Lie type. Now let’s study the maximal tori: we follow [MT, Chapter 25]. First off, we note that, since Frobenius endomorphism commute with elements of $W$ in their action on $T$, the notion of $F$-conjugacy is the same as $\phi$-conjugacy (where $F=q\phi$).</p>
<p>The following principles are important:</p>
<ul>
<li>[MT, Prop. 25.1] The $G^F$-classes of $F$-stable maximal tori of $G$ are in 1-1 correspondence with the $\phi$-conjugacy classes in $W$.</li>
<li>[MT, Exercise 30.5] The $G^F$-classes of subgroups of the form $T^F$ ($T$ an $F$-stable maximal torus of $G$) are in 1-1 correspondence with the two previous sets. (I’m slightly unsure of this… But it seems correct.)</li>
</ul>
<p>These correspondences follow from the Lang-Steinberg theorem. More precisely the first correspondence is as follows: if $gTg^{-1}$ is $F$-stable, then it corresponds to the element $w:=g^{-1}F(g)T\in N_g(T)/T=W$. We are then able to write $T_w$ for the conjugate $gTg^{-1}$. Note that $T_1$ corresponds to an $F$-stable maximal torus in an $F$-stable Borel subgroup. Now [MT, Prop. 25.3] asserts:</p>
<ul>
<li>$T_w^F\cong X/(wF-1)X$;</li>
<li>$|T_w^F|=|\det_{X\otimes \mathbb{R}}(wF-1)|=\det_{X\otimes \mathbb{R}}(q-(w\phi)^{-1})$.</li>
</ul>
<p>Specific calculations now follow. These can be confirmed using Kantor-Seress “Prime power graphs for groups of Lie type”.</p>
<hr />
<h2 id="calculations-for-a_2q">Calculations for $A_2(q)$</h2>
<p>We record the size of the maximal tori for $A_2(q)$. Note that, here and below, the isogeny class does not matter – so, in this case, these calculations are valid for ${\rm PGL}_3(q)$ and ${\rm SL}_3(q)$.</p>
<p><img src="A2.png" alt="" /></p>
<p>We use the fact that the fundamental roots of $A_2$ – labelled $\alpha$ and $\beta$ in the diagram – form a basis for $X\otimes\mathbb{R}$. With respect to this basis we have
<script type="math/tex">% <![CDATA[
q=\left(\begin{matrix} q & 0 \\ 0 & q \end{matrix}\right). %]]></script>
In this case $\phi$ is trivial, so we just need to write down $q-w^{-1}$. The possibilities are as follows:</p>
<ul>
<li>$w=1$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 1 & 0 \\ 0 & 1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q-1 & 0 \\ 0 & q-1\end{matrix}\right) =(q-1)^2. %]]></script>
<ul>
<li>$w=Ref_\alpha$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} -1 & 1\\ 0 & 1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q+1 & -1 \\ 0 & q-1\end{matrix}\right) = q^2-1. %]]></script>
<ul>
<li>$w=Rot_{\pi/3}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 0 & -1\\ 1 & -1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1}=\det\left(\begin{matrix} q & 1 \\ -1 & q+1\end{matrix}\right) = q^2+q+1. %]]></script>
<hr />
<h2 id="calculations-for-2a_2q">Calculations for ${^2A_2}(q)$</h2>
<p>We record the size of the maximal tori for ${^2A_2}(q)$. The root system is as before, and we have the same value for $q$, but this time time $\phi$ is non-trivial.</p>
<p>Using the same basis as before – ${\alpha, \beta}$, we can write $\phi$ as <script type="math/tex">% <![CDATA[
\left(\begin{matrix} 0 & 1 \\ 1 & 0 \end{matrix}\right) %]]></script>. This is just taking $\phi$ acting on the Dynkin diagram. (Stupid comment: I’ve never cottoned on to the fact, hitherto, that $\phi$ is also an automorphism of the root system. In particular it normalizes the Weyl group which here is $W\cong D_6$. So we get $\langle W, \phi\rangle \cong D_{12}$. This is clearly true in general.)</p>
<p>So now we need to write down $q-(\phi w)^{-1}$. The possibilities for $w$ are as before:</p>
<ul>
<li>$w=1$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 1 & 0 \\ 0 & 1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-(\phi w)^{-1})=\det\left(\begin{matrix} q & 1 \\ 1 & q\end{matrix}\right) = q^2-1. %]]></script>
<ul>
<li>$w=Ref_\alpha$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} -1 & 1\\ 0 & 1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-(\phi w)^{-1})=\det\left(\begin{matrix} q-1 & 1 \\ -1 & q\end{matrix}\right) = q^2-q+1. %]]></script>
<ul>
<li>$w=Ref_{\alpha+\beta}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 0 & -1\\ -1 & 0\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-(\phi w)^{-1})=\det\left(\begin{matrix} q+1 & 0 \\ 0 & q+1\end{matrix}\right) = (q+1)^2. %]]></script>
<p>Note that we need to choose different elements $w$ because the $\phi$-conjugacy classes in $W$ are different to the usual conjugacy classes.</p>
<hr />
<h2 id="calculations-for-g_2q">Calculations for $G_2(q)$</h2>
<p>Recall that $G_2(q)$ has order $q^6(q^2-1)(q^2-1)$.</p>
<p><img src="G2.png" alt="" /></p>
<p>As before, we take ${\alpha, \beta}$ as a basis for $X\otimes\mathbb{R}$, and we note that $\phi$ is trivial, and $q$ is as before. We must go through representatives for each of the conjugacy classes of $W=D_{12}$:</p>
<ul>
<li>$w=1$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 1 & 0 \\ 0 & 1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q-1 & 0 \\ 0 & q-1\end{matrix}\right) =(q-1)^2. %]]></script>
<ul>
<li>$w=-1=Rot_{\pi/2}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} -1 & 0\\ 0 & -1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q+1 & 0 \\ 0 & q+1\end{matrix}\right) = (q+1)^2. %]]></script>
<ul>
<li>$w=Rot_{\pi/3}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 1 & -3\\ 1 & -2\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q-1 & -1 \\ 3 & q+2\end{matrix}\right) = q^2+q+1. %]]></script>
<ul>
<li>$w=Rot_{\pi/6}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 2 & -3\\ 1 & -1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q-2 & 3 \\ -1 & q+1\end{matrix}\right) = q^2-q+1. %]]></script>
<ul>
<li>$w=Ref_{3\alpha+2\beta}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 1 & -3\\ 0 & -1\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q-1 & 3 \\ 0 & q+1\end{matrix}\right) = q^2-1. %]]></script>
<p>This yields all of the maximal tori that are listed in Kantor-Seress. However note that there are two conjugacy classes of reflections in $D_{12}$ – here they correspond to reflections in long and short roots – and so we obtain another example:</p>
<ul>
<li>$w=Ref_{\alpha+\beta}$. Then <script type="math/tex">% <![CDATA[
w=\left(\begin{matrix} 2 & -3\\ 1 & -2\end{matrix}\right) %]]></script> and</li>
</ul>
<script type="math/tex; mode=display">% <![CDATA[
\det(q-w^{-1})=\det\left(\begin{matrix} q-2 & 3 \\ -1 & q+2\end{matrix}\right) = q^2-1. %]]></script>
<p>Thus it appears that there are two conjugacy classes of maximal torus of order $q^2-1$ – I guess one occurs as a split torus in a Levi factor ${\rm GL}_2(q)=\langle U_\alpha, U_{-\alpha}\rangle$, while the other occurs in ${\rm GL}_2(q)=\langle U_\beta, U_{-\beta}\rangle$. I reconcile this to Kantor-Seress by noting that they do not necessarily claim to list all conjugacy classes of tori, although in some places they do note that there is more than one conjugacy class of a certain order.</p>nickgillI’ve been re-reading parts of Carter’s “Finite groups of Lie type” and Malle-Testerman’s “Linear algebraic groups and finite groups of Lie type” with a view to understanding the theory of maximal tori in finite groups of Lie type. In this post I want to use the theory in those books to write down the orders of the maximal tori of $A_2(q)$, ${^2A_2(q)}$ and $G_2(q)$. I wanted to also do ${^2G_2(q)}$ but, so far, I haven’t managed to write things down properly for the Ree and Suzuki groups, so I’ll exclude these from what follows. The general set-up is as follows: $G$ is a simple linear algebraic groups, and $F:G\to G$ is a Steinberg endomorphism, i.e. some power $F^m:G\to G$ is a Frobenius endomorphism of $G$. (Some of this theory works more generally – for $G$ connected reductive – and, in particular, this can be important when one studies centralizers inside a simple LAG’s…. But I’m not going there just now.) Now a theorem of Steinberg asserts that $G^F$, the set of fixed-points of $F$, is a finite set [MT, Theorem 21.5] – such a group is an example of a finite group of Lie type. Now the Lang-Steinberg theorem asserts that the map $L:G\to G, \, g\mapsto F(g) g^{-1}$ is surjective [MT, Theorem 21.7]. This theorem then implies that $G$ contains an $F$-stable maximal torus $T$ inside an $F$-stable Borel subgroup $B$. Since $T$ is $F$-stable, $N_G(T)$ is also $F$-stable, and so $F$ naturally acts on the Weyl group $W=N_G(T)/T$ of $G$. Similarly, $F$ acts on the character group $X:=X(T)$ via We will need the notion of $F$-conjugacy in $W$: if $w_1, w_2\in W$, then $w_1$ is $F$-conjugate with $w_2$ if there exists $g\in W$ such that $w_1=F(g)w_2g^{-1}$. Let $\Phi\subset X$ be the root system of $G$ with positive system $\Phi^+$ with respect to $T$ and $B$. In what follows we write $X_\mathbb{R}:=X\otimes_{\mathbb{Z}}\mathbb{R}$. Now the first three results of [MT, Section 22.1] imply that there exists a natural number $\delta$ such that $F^\delta=r.1$ in its action on $X$, where $r$ is some power of $p$; there exists a permutation $\rho$ of $\Phi^+$ such that, for each $\alpha\in\Phi^+$, $F(\rho(\alpha)) = q_\alpha \alpha$ where $q_\alpha>1$ is a power of $p$; the parameter $q_\alpha$ is constant on root lengths; moreover, either $q_\alpha=q$ or else $(G,p)\in{(B_2,2), (G_2,3), (F_4,2)}$, $\rho$ interchanges long and short roots, and $q_{long}.q_{short}=q^2$ with $q_{short}/q_{long}=p$; setting $q=r^{1/\delta}$, we have that $F=q\phi$, where $q$ is the Frobenius endomorphism, and $\phi\in {\rm Aut}(X_\mathbb{R})$ is of order $\delta$ inducing $\rho^{-1}$ on $\Phi^+$; $T^F=X/(F-1)/X$. It is important to note that, in principle, $q$ is a fractional power of $p$ (although, in fact, it will be integral except when $G^F$ is Ree or Suzuki). Note, too, that this set-up clearly defines the real number $q$ to be associated to our finite group of Lie type – for certain families (e.g. the unitaries), the value of $q$ follows varying conventions whereas here it is clear cut. We have set-up all the necessary parameters associated with our group of Lie type. Now let’s study the maximal tori: we follow [MT, Chapter 25]. First off, we note that, since Frobenius endomorphism commute with elements of $W$ in their action on $T$, the notion of $F$-conjugacy is the same as $\phi$-conjugacy (where $F=q\phi$). The following principles are important: [MT, Prop. 25.1] The $G^F$-classes of $F$-stable maximal tori of $G$ are in 1-1 correspondence with the $\phi$-conjugacy classes in $W$. [MT, Exercise 30.5] The $G^F$-classes of subgroups of the form $T^F$ ($T$ an $F$-stable maximal torus of $G$) are in 1-1 correspondence with the two previous sets. (I’m slightly unsure of this… But it seems correct.) These correspondences follow from the Lang-Steinberg theorem. More precisely the first correspondence is as follows: if $gTg^{-1}$ is $F$-stable, then it corresponds to the element $w:=g^{-1}F(g)T\in N_g(T)/T=W$. We are then able to write $T_w$ for the conjugate $gTg^{-1}$. Note that $T_1$ corresponds to an $F$-stable maximal torus in an $F$-stable Borel subgroup. Now [MT, Prop. 25.3] asserts: $T_w^F\cong X/(wF-1)X$; $|T_w^F|=|\det_{X\otimes \mathbb{R}}(wF-1)|=\det_{X\otimes \mathbb{R}}(q-(w\phi)^{-1})$. Specific calculations now follow. These can be confirmed using Kantor-Seress “Prime power graphs for groups of Lie type”. Calculations for $A_2(q)$ We record the size of the maximal tori for $A_2(q)$. Note that, here and below, the isogeny class does not matter – so, in this case, these calculations are valid for ${\rm PGL}_3(q)$ and ${\rm SL}_3(q)$. We use the fact that the fundamental roots of $A_2$ – labelled $\alpha$ and $\beta$ in the diagram – form a basis for $X\otimes\mathbb{R}$. With respect to this basis we have In this case $\phi$ is trivial, so we just need to write down $q-w^{-1}$. The possibilities are as follows: $w=1$. Then and $w=Ref_\alpha$. Then and $w=Rot_{\pi/3}$. Then and Calculations for ${^2A_2}(q)$ We record the size of the maximal tori for ${^2A_2}(q)$. The root system is as before, and we have the same value for $q$, but this time time $\phi$ is non-trivial. Using the same basis as before – ${\alpha, \beta}$, we can write $\phi$ as . This is just taking $\phi$ acting on the Dynkin diagram. (Stupid comment: I’ve never cottoned on to the fact, hitherto, that $\phi$ is also an automorphism of the root system. In particular it normalizes the Weyl group which here is $W\cong D_6$. So we get $\langle W, \phi\rangle \cong D_{12}$. This is clearly true in general.) So now we need to write down $q-(\phi w)^{-1}$. The possibilities for $w$ are as before: $w=1$. Then and $w=Ref_\alpha$. Then and $w=Ref_{\alpha+\beta}$. Then and Note that we need to choose different elements $w$ because the $\phi$-conjugacy classes in $W$ are different to the usual conjugacy classes. Calculations for $G_2(q)$ Recall that $G_2(q)$ has order $q^6(q^2-1)(q^2-1)$. As before, we take ${\alpha, \beta}$ as a basis for $X\otimes\mathbb{R}$, and we note that $\phi$ is trivial, and $q$ is as before. We must go through representatives for each of the conjugacy classes of $W=D_{12}$: $w=1$. Then and $w=-1=Rot_{\pi/2}$. Then and $w=Rot_{\pi/3}$. Then and $w=Rot_{\pi/6}$. Then and $w=Ref_{3\alpha+2\beta}$. Then and This yields all of the maximal tori that are listed in Kantor-Seress. However note that there are two conjugacy classes of reflections in $D_{12}$ – here they correspond to reflections in long and short roots – and so we obtain another example: $w=Ref_{\alpha+\beta}$. Then and Thus it appears that there are two conjugacy classes of maximal torus of order $q^2-1$ – I guess one occurs as a split torus in a Levi factor ${\rm GL}_2(q)=\langle U_\alpha, U_{-\alpha}\rangle$, while the other occurs in ${\rm GL}_2(q)=\langle U_\beta, U_{-\beta}\rangle$. I reconcile this to Kantor-Seress by noting that they do not necessarily claim to list all conjugacy classes of tori, although in some places they do note that there is more than one conjugacy class of a certain order.Tuna Altinel2019-06-06T00:00:00+00:002019-06-06T00:00:00+00:00https://nickpgill.github.io/tuna-altinel<p>I was recently alerted to a <a href="https://euro-math-soc.eu/news/19/05/14/ems-statement-arrest-prof-tuna-altinel">European Maths Society statement on the arrest of Professor Tuna Altinel</a>. I reproduce that statement below. The situation sounds bad, and I so I am posting here to alert members of the mathematical community to what is going on. If you wish to show solidarity with Professor Altinel, then you can do so by signing the petition <a href="http://math.univ-lyon1.fr/SoutienTunaAltinel/?lang=en">here</a>.</p>
<h3 id="ems-statement-on-the-arrest-of-prof-tuna-altinel">EMS Statement on the Arrest of Prof Tuna Altinel</h3>
<blockquote>
<p>Last week the mathematician Tuna Altinel, member of the European Mathematical Society and professor at the Université Lyon 1 in France, was arrested in Turkey after he had his passport extracted by the police. Tuna Altinel was one of the signatories of the peace petition supported by more than 2000 scientists and intellectuals against military actions towards civilians.</p>
</blockquote>
<blockquote>
<p>The European Mathematical Society condemns this violation of Prof Altinel’s human rights and demands that he is immediately released and allowed to return to France to resume his teaching and research.</p>
</blockquote>nickgillI was recently alerted to a European Maths Society statement on the arrest of Professor Tuna Altinel. I reproduce that statement below. The situation sounds bad, and I so I am posting here to alert members of the mathematical community to what is going on. If you wish to show solidarity with Professor Altinel, then you can do so by signing the petition here. EMS Statement on the Arrest of Prof Tuna Altinel Last week the mathematician Tuna Altinel, member of the European Mathematical Society and professor at the Université Lyon 1 in France, was arrested in Turkey after he had his passport extracted by the police. Tuna Altinel was one of the signatories of the peace petition supported by more than 2000 scientists and intellectuals against military actions towards civilians. The European Mathematical Society condemns this violation of Prof Altinel’s human rights and demands that he is immediately released and allowed to return to France to resume his teaching and research.A Rodgers-Saxl type conjecture for characters2019-04-05T00:00:00+00:002019-04-05T00:00:00+00:00https://nickpgill.github.io/a-rodgers-saxl-conjecture-for-characters<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'],
inlineMath: [['$','$']]
}
});
</script>
<script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script>
<p>This is a follow-up to my <a href="https://nickpgill.github.io/a-rodgers-saxl-theorem">previous post on a generalization of a theorem of Rodgers and Saxl</a>.</p>
<p>The story starts with a beautiful talk I heard by Martin Liebeck in which he outlined a result due to him, Shalev & Tiep:</p>
<p><strong>Theorem</strong>: Let $f$ be a faithful irreducible of $Sym(n)$. Then $f^{*4n}$ (i.e.tensor product $4n$ times) contains every irreducible as a constituent.</p>
<p>This theorem can be interpreted as giving an upper bound on the diameter of the <a href="https://en.wikipedia.org/wiki/McKay_graph">McKay graphs</a> of the symmetric group. I won’t pursue this point of view, but it was within this context that the LST-team were working when they proved the theorem. I’m just stating the symmetric group version of their result – they had more general statements for finite (almost) simple groups.</p>
<p>Notice that the LPT-bound is pretty much as good as one could hope for: if $f^{*c}$ is to contain every irreducible as a constituent (for some positive integer $c$), then one needs $(\dim(f))^c > \sum \dim(f_i)$ where the sum on the right hand side ranges over all irreducibles of $Sym(n)$. Now the theory of Frobenius-Schur indicators tells us that, since all complex reps of $Sym(n)$ are defined over the reals, then $\sum \dim(f_i)$ is equal to 1+ the number of elements of order $2$. Writing $I_n$ for this latter quantity, <a href="https://projecteuclid.org/download/pdf_1/euclid.bams/1183553478">a result of Moser and Wyman</a> asserts that</p>
<script type="math/tex; mode=display">I_n \sim\frac{1}{\sqrt{2}} n^{n/2} \exp(-n/2-1/4+\sqrt{n}).</script>
<p>Now, using the fact that there exists an irreducible of dimension $n-1$, we obtain that</p>
<script type="math/tex; mode=display">c>= \log (\sum \dim(f_i))/ \log(\dim(f) = \log (I_n+1)/ \log (n-1),</script>
<p>and we conclude that $c$ must be at least linear in $n$.</p>
<p>A well-known heuristic in finite group theory says that whenever one proves statements about (ordinary) characters, there is probably a statement about conjugacy classes lurking nearby (and vice versa). This heuristic sounds very wooly, but it can be made rigorous in very many different contexts, and in very many different ways.</p>
<p>Sure enough, there is a “conjugacy class version” of the theorem above – it was proved by Liebeck and Shalev:</p>
<p><strong>Theorem</strong>: There exists a constant $d$ such that if $C$ is a conjugacy class of $G$, a finite non-abelian simple group and if
<script type="math/tex">k >= d \log|G|/ \log|C|,</script>
then $C^k = G$.</p>
<p>Here we are taking products of conjugacy classes instead of tensor products of characters. But, again, the result is of the same kind – it says that by taking a product $d$ times, then you will obtain all conjugacy classes, and $d$ is as small as one could possibly ask for, up to a multiplicative constant.</p>
<p>So, now, recall that in the previous post, I made the following conjecture:</p>
<p><strong>Conjecture</strong>: There exists a constant $c$ such that if $G$ is a finite simple group, and $S_1,\dots, S_k$ are subsets of $G$ satisfying
$\Pi_{i=1}^k|S_i|\geq|G|^c$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$.</p>
<p>A special case of this conjecture occurs when our sets $S_1,\dots, S_k$ are conjugacy classes of $G$. In this case, we obtain the following statement:</p>
<p><strong>Conjecture</strong>: There exists a constant $c$ such that if $G$ is a finite simple group, and $C_1,\dots, C_k$ are conjugacy classes of $G$ satisfying
$\Pi_{i=1}^k|S_i|\geq|G|^c$, then $G=C_1\cdot C_2\cdots C_k$.</p>
<p>I don’t know how to prove this theorem, but it’s possible that it’s not out of reach. The Rodgers–Saxl theorem that started all this off implies that the conjecture is true for the family $PSL(n,q)$ with the constant $c=12$. The theorem I proved with Pyber and Szabo implies it for groups of Lie type of bounded rank, so one is left with (some of) the classicals of unbounded rank, and the alternating groups.</p>
<p>But back to chacters. What would be the character–theoretic version of the previous two conjectures? The first has, if I recall correctly, been stated by the LST-team:</p>
<p><strong>Conjecture</strong> There exists $C>0$ such that if $\chi$ is a non-trivial character of a finite simple group $G$ and if
<script type="math/tex">c>C \log(\textrm{sum of dimensions of all irreducibles of }G)/ \log(\textrm{dimension of }\chi),</script>
then $\chi^{*c}$ contains every irreducible of $G$ as a constituent.</p>
<p>The Rodgers-Saxl analogue of this would be:</p>
<p><strong>Conjecture</strong> There exists $C>0$ such that if $\chi_1,…, \chi_t$ are non-trivial characters of a finite simple group $G$ and if</p>
<script type="math/tex; mode=display">\dim(\chi_1)*\dim(\chi_2)*...*\dim(\chi_t) > (\textrm{sum of dimensions of all irreducibles of }G)^C</script>
<p>then $\chi_{1}*\cdots *\chi_{t}$ contains every irreducible of $G$ as a constituent.</p>
<p>Let’s think about whether proving something like this might be possible just for the special case of $G=Sym(n)$ (OK, it’s not simple, but almost).</p>
<p>First let me note that LST prove their result by showing that if $f$ is a faithful character of $Sym(n)$, then $f * f$ or $f *f *f *f$ always contains $\chi_{1,n-1}$, from which the result follows (one just calculates how many tensor products of $\chi_{1,n-1}$ one needs to obtain all irreducibles as constituents).</p>
<p>My go-to man for symmetric group rep theory is Mark Wildon. I dropped him an email with the following question.</p>
<p><strong>Question</strong>: Does there exist a positive integer $N$ such that if $k> N$ and $f_1, …, f_k$ are irreducible characters of Sym(n), then the tensor product of $f_1,…, f_k$ (in that order) contains an irreducible constituent isomorphic to $\chi_{1,n-1}$?</p>
<p>Mark was immediately able to shed light. This question can be answered affirmatively. Indeed the following argument (which is Mark’s) shows that something much stronger is true:</p>
<p>Let $k$ be a field and let $G$ be a finite group. On page 45 of Alperin, <em>Local Representation Theory</em>, it’s shown that if $V$ is a faithful $k$G-module then there exists $N$ such that the $N$-fold tensor product $V \otimes … \otimes V$ contains a free submodule. Since $V \otimes F \cong F \oplus … \oplus F$ (with $\dim(V)$ summands) for any free $kG$-module $F$, it follows that any product with more factors (which may be arbitrary kG-modules) also contains a free submodule.</p>
<p>In the language of characters: if $\chi$ is the character of $V$, and $\psi$ is any other character, then any character $\chi^N \times \psi$ contains the regular character.</p>
<p><strong>Corollary</strong>: there exists $M$ such that any product of any $M$ faithful irreducible characters of $Sym(n)$ contains the regular character as a constituent.</p>
<p><strong>Proof</strong>: let $P$ be the number of faithful irreducible characters of $Sym(n)$. (So $P$ is 2 less than the number of partitions of $n$, unless $n = 4$.) For each faithful character, let $N(\chi)$ be the $N$ given by Alperin’s result, and let $N = \max_\chi N(\chi)$. Take $M = NP$. Then in any product of $M$ faithful characters, some character appears at least $N$ times, and so the product contains the regular character. QED</p>
<p>That’s a brilliant start, but it doesn’t give us any information about what $M$ can be. The same argument as I gave at the top of this post implies that $M$ must be bounded below by some linear function in $n$: so, then, it it possible that one can choose $M$ to be linear in $n$?</p>
<p>Here’s what Mark had to say on the subject:</p>
<blockquote>
<p><em>Some experiments in MAGMA suggest rather intriguingly that one can take
$M = n - 1$ for $Sym(n)$. This bound is sharp for $n = 3,\dots, 10$.</em></p>
</blockquote>
<p>Is this enough evidence to make a conjecture? Hell, yeah!</p>
<p><strong>Conjecture</strong>: Suppose that $f_1,\dots, f_{n-1}$ are faithful irreducible characters of $Sym(n)$. Then $f_1* \cdots* f_{n-1}$ contains the regular character as a constituent.</p>
<p>I think of this as a “Rodgers-Saxl type conjecture for characters”. Now, the challenge is to turn it into a theorem….</p>nickgillThis is a follow-up to my previous post on a generalization of a theorem of Rodgers and Saxl. The story starts with a beautiful talk I heard by Martin Liebeck in which he outlined a result due to him, Shalev & Tiep: Theorem: Let $f$ be a faithful irreducible of $Sym(n)$. Then $f^{*4n}$ (i.e.tensor product $4n$ times) contains every irreducible as a constituent. This theorem can be interpreted as giving an upper bound on the diameter of the McKay graphs of the symmetric group. I won’t pursue this point of view, but it was within this context that the LST-team were working when they proved the theorem. I’m just stating the symmetric group version of their result – they had more general statements for finite (almost) simple groups. Notice that the LPT-bound is pretty much as good as one could hope for: if $f^{*c}$ is to contain every irreducible as a constituent (for some positive integer $c$), then one needs $(\dim(f))^c > \sum \dim(f_i)$ where the sum on the right hand side ranges over all irreducibles of $Sym(n)$. Now the theory of Frobenius-Schur indicators tells us that, since all complex reps of $Sym(n)$ are defined over the reals, then $\sum \dim(f_i)$ is equal to 1+ the number of elements of order $2$. Writing $I_n$ for this latter quantity, a result of Moser and Wyman asserts that Now, using the fact that there exists an irreducible of dimension $n-1$, we obtain that and we conclude that $c$ must be at least linear in $n$. A well-known heuristic in finite group theory says that whenever one proves statements about (ordinary) characters, there is probably a statement about conjugacy classes lurking nearby (and vice versa). This heuristic sounds very wooly, but it can be made rigorous in very many different contexts, and in very many different ways. Sure enough, there is a “conjugacy class version” of the theorem above – it was proved by Liebeck and Shalev: Theorem: There exists a constant $d$ such that if $C$ is a conjugacy class of $G$, a finite non-abelian simple group and if then $C^k = G$. Here we are taking products of conjugacy classes instead of tensor products of characters. But, again, the result is of the same kind – it says that by taking a product $d$ times, then you will obtain all conjugacy classes, and $d$ is as small as one could possibly ask for, up to a multiplicative constant. So, now, recall that in the previous post, I made the following conjecture: Conjecture: There exists a constant $c$ such that if $G$ is a finite simple group, and $S_1,\dots, S_k$ are subsets of $G$ satisfying $\Pi_{i=1}^k|S_i|\geq|G|^c$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$. A special case of this conjecture occurs when our sets $S_1,\dots, S_k$ are conjugacy classes of $G$. In this case, we obtain the following statement: Conjecture: There exists a constant $c$ such that if $G$ is a finite simple group, and $C_1,\dots, C_k$ are conjugacy classes of $G$ satisfying $\Pi_{i=1}^k|S_i|\geq|G|^c$, then $G=C_1\cdot C_2\cdots C_k$. I don’t know how to prove this theorem, but it’s possible that it’s not out of reach. The Rodgers–Saxl theorem that started all this off implies that the conjecture is true for the family $PSL(n,q)$ with the constant $c=12$. The theorem I proved with Pyber and Szabo implies it for groups of Lie type of bounded rank, so one is left with (some of) the classicals of unbounded rank, and the alternating groups. But back to chacters. What would be the character–theoretic version of the previous two conjectures? The first has, if I recall correctly, been stated by the LST-team: Conjecture There exists $C>0$ such that if $\chi$ is a non-trivial character of a finite simple group $G$ and if then $\chi^{*c}$ contains every irreducible of $G$ as a constituent. The Rodgers-Saxl analogue of this would be: Conjecture There exists $C>0$ such that if $\chi_1,…, \chi_t$ are non-trivial characters of a finite simple group $G$ and if then $\chi_{1}*\cdots *\chi_{t}$ contains every irreducible of $G$ as a constituent. Let’s think about whether proving something like this might be possible just for the special case of $G=Sym(n)$ (OK, it’s not simple, but almost). First let me note that LST prove their result by showing that if $f$ is a faithful character of $Sym(n)$, then $f * f$ or $f *f *f *f$ always contains $\chi_{1,n-1}$, from which the result follows (one just calculates how many tensor products of $\chi_{1,n-1}$ one needs to obtain all irreducibles as constituents). My go-to man for symmetric group rep theory is Mark Wildon. I dropped him an email with the following question. Question: Does there exist a positive integer $N$ such that if $k> N$ and $f_1, …, f_k$ are irreducible characters of Sym(n), then the tensor product of $f_1,…, f_k$ (in that order) contains an irreducible constituent isomorphic to $\chi_{1,n-1}$? Mark was immediately able to shed light. This question can be answered affirmatively. Indeed the following argument (which is Mark’s) shows that something much stronger is true: Let $k$ be a field and let $G$ be a finite group. On page 45 of Alperin, Local Representation Theory, it’s shown that if $V$ is a faithful $k$G-module then there exists $N$ such that the $N$-fold tensor product $V \otimes … \otimes V$ contains a free submodule. Since $V \otimes F \cong F \oplus … \oplus F$ (with $\dim(V)$ summands) for any free $kG$-module $F$, it follows that any product with more factors (which may be arbitrary kG-modules) also contains a free submodule. In the language of characters: if $\chi$ is the character of $V$, and $\psi$ is any other character, then any character $\chi^N \times \psi$ contains the regular character. Corollary: there exists $M$ such that any product of any $M$ faithful irreducible characters of $Sym(n)$ contains the regular character as a constituent. Proof: let $P$ be the number of faithful irreducible characters of $Sym(n)$. (So $P$ is 2 less than the number of partitions of $n$, unless $n = 4$.) For each faithful character, let $N(\chi)$ be the $N$ given by Alperin’s result, and let $N = \max_\chi N(\chi)$. Take $M = NP$. Then in any product of $M$ faithful characters, some character appears at least $N$ times, and so the product contains the regular character. QED That’s a brilliant start, but it doesn’t give us any information about what $M$ can be. The same argument as I gave at the top of this post implies that $M$ must be bounded below by some linear function in $n$: so, then, it it possible that one can choose $M$ to be linear in $n$? Here’s what Mark had to say on the subject: Some experiments in MAGMA suggest rather intriguingly that one can take $M = n - 1$ for $Sym(n)$. This bound is sharp for $n = 3,\dots, 10$. Is this enough evidence to make a conjecture? Hell, yeah! Conjecture: Suppose that $f_1,\dots, f_{n-1}$ are faithful irreducible characters of $Sym(n)$. Then $f_1* \cdots* f_{n-1}$ contains the regular character as a constituent. I think of this as a “Rodgers-Saxl type conjecture for characters”. Now, the challenge is to turn it into a theorem….A Rodgers-Saxl type theorem2019-03-29T00:00:00+00:002019-03-29T00:00:00+00:00https://nickpgill.github.io/a-rodgers-saxl-theorem<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'],
inlineMath: [['$','$']]
}
});
</script>
<script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script>
<p>Pyber, Szabó and I have recently completed a paper entitled <em>A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank</em>. A copy of the paper can be found <a href="https://arxiv.org/abs/1901.09255">on the arXiv</a>.</p>
<p>Our result was inspired by a result of Rodgers and Saxl which appeared in <em>Communications of Algebra</em> in 2003:</p>
<p><strong>Theorem</strong>: Suppose that $C_1,\dots, C_k$ are conjugacy classes in $SL_n(q)$ such that
$\Pi_{i=1}^k|C_i|\geq|SL_n(q)|^{12}$. Then
$\Pi_{i=1}^kC_i=SL_n(q)$.</p>
<p>Our result has a similar flavour.</p>
<p><strong>Theorem</strong>: Let $G=G_r(q)$ be a finite simple group of Lie type of rank $r$. There exists $c=f(r)$ such that if $S_1,\dots, S_k$ are subsets of $G$ satisfying
$\Pi_{i=1}^k|S_i|\geq|G|^c$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$.</p>
<p>Our theorem differs to that of Rodgers and Saxl in three important respects, two good, one not so good: First, our result pertains to all finite simple groups $G$ of Lie type. Second, our result does not just pertain to conjugacy classes, but to subsets of the group, provided we are free to take conjugates.</p>
<p>The third difference is a weak point: our result replaces the constant ``12’’ in their thereom with an unspecified constant that depends on the rank of the group $G$. We conjecture that we should be able to do better, and not just for finite simple groups of Lie type, but for alternating groups as well:</p>
<p><strong>Conjecture</strong>: Let $G$ be a finite simple group. There exists $c$ such that if $S_1,\dots, S_k$ are subsets of $G$ satisfying
$\Pi_{i=1}^k|S_i|\geq|G|^c$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$.</p>
<p>This conjecture seems hard! Our theorem has a rank-dependency because it makes use of the “Product Theorem” which was proved, independently by Pyber-Szabó and by Breuillard-Green-Tao. To prove the conjecture we would need to replace the Product Theorem in our argument with, um, something else… But what?!</p>
<p>One last remark: there is a fourth sense in which our theorem differs to that of Rodgers and Saxl – we are interested in finite simple groups, while they consider $SL_n(q)$ which is, in general, only quasi-simple.</p>
<p>It turns out that the distinction here is not significant: It is not hard to show that our theorem is true if and only if the analogous statement is true for quasi-simple groups (provided you require that the sets $S_i$ do not intersect the centre of $G$)… And the same is true of the conjecture stated above. So the stated conjecture would be a generalization of both our result and that of Rodgers and Saxl, albeit we don’t specify the value of $c$ as Rodgers and Saxl did.</p>
<p>Let me finish this post by thanking my two co-authors, Laci and Bandi. I have worked with these two guys on a previous paper, and they are both brilliant and generous with their many ideas. I hope to have the privilege of working with them more in the future.</p>nickgillPyber, Szabó and I have recently completed a paper entitled A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank. A copy of the paper can be found on the arXiv. Our result was inspired by a result of Rodgers and Saxl which appeared in Communications of Algebra in 2003: Theorem: Suppose that $C_1,\dots, C_k$ are conjugacy classes in $SL_n(q)$ such that $\Pi_{i=1}^k|C_i|\geq|SL_n(q)|^{12}$. Then $\Pi_{i=1}^kC_i=SL_n(q)$. Our result has a similar flavour. Theorem: Let $G=G_r(q)$ be a finite simple group of Lie type of rank $r$. There exists $c=f(r)$ such that if $S_1,\dots, S_k$ are subsets of $G$ satisfying $\Pi_{i=1}^k|S_i|\geq|G|^c$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$. Our theorem differs to that of Rodgers and Saxl in three important respects, two good, one not so good: First, our result pertains to all finite simple groups $G$ of Lie type. Second, our result does not just pertain to conjugacy classes, but to subsets of the group, provided we are free to take conjugates. The third difference is a weak point: our result replaces the constant ``12’’ in their thereom with an unspecified constant that depends on the rank of the group $G$. We conjecture that we should be able to do better, and not just for finite simple groups of Lie type, but for alternating groups as well: Conjecture: Let $G$ be a finite simple group. There exists $c$ such that if $S_1,\dots, S_k$ are subsets of $G$ satisfying $\Pi_{i=1}^k|S_i|\geq|G|^c$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$. This conjecture seems hard! Our theorem has a rank-dependency because it makes use of the “Product Theorem” which was proved, independently by Pyber-Szabó and by Breuillard-Green-Tao. To prove the conjecture we would need to replace the Product Theorem in our argument with, um, something else… But what?! One last remark: there is a fourth sense in which our theorem differs to that of Rodgers and Saxl – we are interested in finite simple groups, while they consider $SL_n(q)$ which is, in general, only quasi-simple. It turns out that the distinction here is not significant: It is not hard to show that our theorem is true if and only if the analogous statement is true for quasi-simple groups (provided you require that the sets $S_i$ do not intersect the centre of $G$)… And the same is true of the conjecture stated above. So the stated conjecture would be a generalization of both our result and that of Rodgers and Saxl, albeit we don’t specify the value of $c$ as Rodgers and Saxl did. Let me finish this post by thanking my two co-authors, Laci and Bandi. I have worked with these two guys on a previous paper, and they are both brilliant and generous with their many ideas. I hope to have the privilege of working with them more in the future.Matrices for classical groups2019-01-01T00:00:00+00:002019-01-01T00:00:00+00:00https://nickpgill.github.io/matrices-for-classical-groups<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'],
inlineMath: [['$','$']]
}
});
</script>
<script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script>
<p>A finite classical group is best thought of as a group of linear operators on some vector space defined over a finite field. Which means, of course, that I can take a basis for this vector space and then represent the elements of my group as matrices.</p>
<p>However, I have almost <strong>never</strong> seen anyone do this in the literature. “Taking a basis” is thought of as a rather crude thing to do when doing linear algebra – one generally tries to write general arguments that do not refer to any particular basis. However, speaking for myself, when I’m trying to work out what the hell is going on inside a finite matrix group, I often end up trying to write down individual elements as matrices… And then hiding all this when it comes to writing up the paper!</p>
<p>This means that I have never publicly written down any of these calculations, despite using many of them over and over again. So this page is designed to be a little repository for me to note down interesting observations about such calculations… And perhaps they’ll be useful for someone else some time…</p>
<h2 id="working-with-omega_4q">Working with $\Omega_4^+(q)$</h2>
<p>This family of groups has some weird behaviour, especially when $q$ is even. For instance, let us write $\mathcal{U}$ for the set of maximal totally singular subspaces in a formed space of type $O+$ and dimension $2m$. If $q$ is even, then, provided $(m,q)\neq (2,2)$, we can define $\Omega_{2m}^+(q)$ to be the group inducing odd permutations on $\mathcal{U}$…. If $(m,q)=(2,2)$, however, the group so defined is <strong>not</strong> $\Omega_4^+(2)$, and one needs to define it in a completely different way (see Kleidman and Liebeck, p.31).</p>
<h1 id="finding-some-elements-in-omega_4q">Finding some elements in $\Omega_4^+(q)$.</h1>
<p>Let $(e_1,f_1)$ and $(e_2, f_2)$ be hyperbolic pairs, and consider the basis $\mathcal{B}={e_1, e_2, f_2, f_1}$ maintaining order. Then, one can calculate directly that $O_4^+(q)$ contains elements which are written with respect to $\mathcal{B}$ in the form</p>
<script type="math/tex; mode=display">% <![CDATA[
\begin{pmatrix}
1 & a & b & ab \\ & 1 & & b \\ & & 1 & a \\ & & & 1
\end{pmatrix}; %]]></script>
<p>these elements form a subgroup $S$ of size $q^2$; indeed, for $q$ odd, they form a Sylow $p$-subgroup of $O_4^+(q)$.</p>
<p>When $q$ is odd, one can look at orders to see directly that $S$ is actually a subgroup of $\Omega_4^+(q)$. Indeed, the same is true when $q$ is even, but to see this it is easiest to observe that $S$ is normalized by the element</p>
<script type="math/tex; mode=display">% <![CDATA[
g=\begin{pmatrix}
1 & & & \\ & & 1 & \\ & 1 & & \\ & & & 1
\end{pmatrix}. %]]></script>
<p>This element clearly takes one element $U=\langle e_1, e_2\rangle \in \mathcal{U}_2$ to another element $W=\langle e_1, f_2\rangle\in \mathcal{U}_2$. What is more $U\cap W$ has codimension $1$ in both $U$ and $W$. This allows us to conclude that $g\in SO_4^+(q)\setminus \Omega_4^+(q)$ (see Kleidman and Liebeck, p. 30). Now order considerations imply that $S$ must be a subgroup of $\Omega_4^+(q)$.</p>
<h1 id="finding-all-elements-in-omega_4q">Finding all elements in $\Omega_4^+(q)$.</h1>
<p>Let $R$ be the set of elements whose transpose is in $S$. One sees immediately that both $R$ and $S$ lie in $\Omega_4^+(q)$ and hence so does $\langle R,S\rangle$.</p>
<p>If one sets $a$ to equal $0$, while $b$ ranges across $\mathbb{F}_q$, in both $R$ and $S$, then one immediately observes a copy of $SL_2(q)$ in $\Omega_4^+(q)$. The same is true setting $b$ to equal $0$. Since these two copies effectively “avoid interaction” one immediately obtains a copy of $SL_2(q)\circ SL_2(q)$ inside $\Omega_4^+(q)$. (The central product is due to the fact that both copies of $SL_2(q)$ share $-I$ as an element.)</p>
<p>Now one can observe that $\Omega_4^+(q)$ also contains the element</p>
<script type="math/tex; mode=display">% <![CDATA[
\begin{pmatrix}
& & & 1\\ & & 1 & \\ & 1 & & \\ 1 & & &
\end{pmatrix} %]]></script>
<p>Now order considerations allow us to conclude that $\Omega_4^+(q)\cong (SL_2(q)\circ SL_2(q)):2$, and we have written down all elements of the group.</p>
<h2 id="sp_n-22a--omega_n2a">$Sp_{n-2}(2^a) < \Omega_n^+(2^a)$</h2>
<p>When $q$ is even, $\Omega_n^+(q)$ has a maximal subgroup – the stabilizer of a non-degenerate $1$-space – isomorphic to $Sp_{n-2}(q)$. I will write down the elements of this subgroup for $n=4$; the general case follows similarly.</p>
<p>First, we adjust our basis from before to be $\mathcal{C}={z_1, x_1, x_2, y_2}$ where $z_1=x_1+y_1$.</p>
<p>With respect to this basis, our quadratic form becomes</p>
<script type="math/tex; mode=display">Q(a,b,c,d) = ab+a^2+cd</script>
<p>and we see that $z_1$ is non-singular. Now simply observe that the following elements stabilize $z_1$:</p>
<script type="math/tex; mode=display">% <![CDATA[
\begin{pmatrix}
1 & & & c \\ & 1 & & \\ & c & 1 & c^2 \\ & & & 1
\end{pmatrix}. %]]></script>
<p>Doing the “transpose trick” like before, one immediately obtains a copy of $SL_2(q)$ in this stabilizer and (using the perfectness of $SL_2(q)$ for $q>3$ if necessary), one obtains that the stabilizer of $z_1$ in $\Omega_4^+(q)$ is isomorphic to $SL_2(q)\cong Sp_{2}(q)$.</p>
<p>One can do this more generally for larger $n$ – one simply has to exhibit the root groups of $Sp_{n-2}(q)$ inside the stabilizer of $z_1$ in $\Omega_4^+(q)$. There are two sorts of root group here: the first already ocur in $\Omega_{n-2}^+(q)$ and so are easy to write down in $\Omega_n^+(q)$; the second all take the form given above.</p>nickgillA finite classical group is best thought of as a group of linear operators on some vector space defined over a finite field. Which means, of course, that I can take a basis for this vector space and then represent the elements of my group as matrices. However, I have almost never seen anyone do this in the literature. “Taking a basis” is thought of as a rather crude thing to do when doing linear algebra – one generally tries to write general arguments that do not refer to any particular basis. However, speaking for myself, when I’m trying to work out what the hell is going on inside a finite matrix group, I often end up trying to write down individual elements as matrices… And then hiding all this when it comes to writing up the paper! This means that I have never publicly written down any of these calculations, despite using many of them over and over again. So this page is designed to be a little repository for me to note down interesting observations about such calculations… And perhaps they’ll be useful for someone else some time… Working with $\Omega_4^+(q)$ This family of groups has some weird behaviour, especially when $q$ is even. For instance, let us write $\mathcal{U}$ for the set of maximal totally singular subspaces in a formed space of type $O+$ and dimension $2m$. If $q$ is even, then, provided $(m,q)\neq (2,2)$, we can define $\Omega_{2m}^+(q)$ to be the group inducing odd permutations on $\mathcal{U}$…. If $(m,q)=(2,2)$, however, the group so defined is not $\Omega_4^+(2)$, and one needs to define it in a completely different way (see Kleidman and Liebeck, p.31). Finding some elements in $\Omega_4^+(q)$. Let $(e_1,f_1)$ and $(e_2, f_2)$ be hyperbolic pairs, and consider the basis $\mathcal{B}={e_1, e_2, f_2, f_1}$ maintaining order. Then, one can calculate directly that $O_4^+(q)$ contains elements which are written with respect to $\mathcal{B}$ in the form these elements form a subgroup $S$ of size $q^2$; indeed, for $q$ odd, they form a Sylow $p$-subgroup of $O_4^+(q)$. When $q$ is odd, one can look at orders to see directly that $S$ is actually a subgroup of $\Omega_4^+(q)$. Indeed, the same is true when $q$ is even, but to see this it is easiest to observe that $S$ is normalized by the element This element clearly takes one element $U=\langle e_1, e_2\rangle \in \mathcal{U}_2$ to another element $W=\langle e_1, f_2\rangle\in \mathcal{U}_2$. What is more $U\cap W$ has codimension $1$ in both $U$ and $W$. This allows us to conclude that $g\in SO_4^+(q)\setminus \Omega_4^+(q)$ (see Kleidman and Liebeck, p. 30). Now order considerations imply that $S$ must be a subgroup of $\Omega_4^+(q)$. Finding all elements in $\Omega_4^+(q)$. Let $R$ be the set of elements whose transpose is in $S$. One sees immediately that both $R$ and $S$ lie in $\Omega_4^+(q)$ and hence so does $\langle R,S\rangle$. If one sets $a$ to equal $0$, while $b$ ranges across $\mathbb{F}_q$, in both $R$ and $S$, then one immediately observes a copy of $SL_2(q)$ in $\Omega_4^+(q)$. The same is true setting $b$ to equal $0$. Since these two copies effectively “avoid interaction” one immediately obtains a copy of $SL_2(q)\circ SL_2(q)$ inside $\Omega_4^+(q)$. (The central product is due to the fact that both copies of $SL_2(q)$ share $-I$ as an element.) Now one can observe that $\Omega_4^+(q)$ also contains the element Now order considerations allow us to conclude that $\Omega_4^+(q)\cong (SL_2(q)\circ SL_2(q)):2$, and we have written down all elements of the group. $Sp_{n-2}(2^a) < \Omega_n^+(2^a)$ When $q$ is even, $\Omega_n^+(q)$ has a maximal subgroup – the stabilizer of a non-degenerate $1$-space – isomorphic to $Sp_{n-2}(q)$. I will write down the elements of this subgroup for $n=4$; the general case follows similarly. First, we adjust our basis from before to be $\mathcal{C}={z_1, x_1, x_2, y_2}$ where $z_1=x_1+y_1$. With respect to this basis, our quadratic form becomes and we see that $z_1$ is non-singular. Now simply observe that the following elements stabilize $z_1$: Doing the “transpose trick” like before, one immediately obtains a copy of $SL_2(q)$ in this stabilizer and (using the perfectness of $SL_2(q)$ for $q>3$ if necessary), one obtains that the stabilizer of $z_1$ in $\Omega_4^+(q)$ is isomorphic to $SL_2(q)\cong Sp_{2}(q)$. One can do this more generally for larger $n$ – one simply has to exhibit the root groups of $Sp_{n-2}(q)$ inside the stabilizer of $z_1$ in $\Omega_4^+(q)$. There are two sorts of root group here: the first already ocur in $\Omega_{n-2}^+(q)$ and so are easy to write down in $\Omega_n^+(q)$; the second all take the form given above.Groups with identical element counts2018-12-20T00:00:00+00:002018-12-20T00:00:00+00:00https://nickpgill.github.io/groups-with-identical-element-counts<script type="text/x-mathjax-config">
MathJax.Hub.Config({
tex2jax: {
skipTags: ['script', 'noscript', 'style', 'textarea', 'pre'],
inlineMath: [['$','$']]
}
});
</script>
<script src="https://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS-MML_HTMLorMML" type="text/javascript"></script>
<p>Some time ago I heard an interesting story about a remarkable mathematical fact. I can’t locate the source right now, so here is the story as I understand it.</p>
<p>If one consults the <em>Atlas of Finite Groups</em> and looks at the maximal subgroups of the Mathieu group $M_{23}$, one will observe that it has two rather different maximal subgroups, both of which have order 40320. The first is of form $PSL_3(4):2$; the second has form $2^4:A_7$.</p>
<p>It’s important to note how <strong>very different</strong> these two groups are, despite their shared order: in particular, they have different non-abelian composition factors.</p>
<p>John G. Thompson investigated these groups a little further and observed the following remarkable fact: they have <strong>exactly the same element count, by order</strong>. By which I mean that they have the same number of elements of order 2; the same number of elements of order 3; and so on. (How he realised this, I really don’t know – but I guess geniuses tend to realise more things than the rest of us…)</p>
<p>Thompson’s observation led him to make the following conjecture: <em>Suppose that two groups, G and H, have exactly the same element count, by order. Suppose, moreover, that G is solvable. Then H is solvable.</em></p>
<p>This conjecture can be interpreted as saying that it is, in principle, possible to recognise whether or not a group is solvable simply by knowing the number of elements in the group of each different order. Note, that I say “in principle”, as it is not proposing an algorithm for recognising solvability in this way – that is a harder question.</p>
<p>By way of comparison, it is easy to see that there is an algorithm to recognise <em>nilpotency</em> by knowing the number of elements in the group of each different order – one simply tests whether, for each prime <em>p</em> dividing the order of the group, the number of elements of order a power of <em>p</em> is equal to the highest power of <em>p</em> dividing the order of the group. If this is true for all <em>p</em>, then the group has a unique Sylow <em>p</em>-subgroup for each prime <em>p</em> dividing its order, and this property characterises nilpotency.</p>
<p>As I understand it, Thompson’s conjecture has been proved… but I’m not sure by whom. If anyone could point me to a source, I’d like to give appropriate credit! I don’t know if an algorithm for recognising solvability in this way has ever been written down. I’m also unable to point to the place where Thompson first made the observation about these subgroups of $M_{23}$ and where he first stated this conjecture; again any help with sources would be appreciated.</p>nickgillSome time ago I heard an interesting story about a remarkable mathematical fact. I can’t locate the source right now, so here is the story as I understand it. If one consults the Atlas of Finite Groups and looks at the maximal subgroups of the Mathieu group $M_{23}$, one will observe that it has two rather different maximal subgroups, both of which have order 40320. The first is of form $PSL_3(4):2$; the second has form $2^4:A_7$. It’s important to note how very different these two groups are, despite their shared order: in particular, they have different non-abelian composition factors. John G. Thompson investigated these groups a little further and observed the following remarkable fact: they have exactly the same element count, by order. By which I mean that they have the same number of elements of order 2; the same number of elements of order 3; and so on. (How he realised this, I really don’t know – but I guess geniuses tend to realise more things than the rest of us…) Thompson’s observation led him to make the following conjecture: Suppose that two groups, G and H, have exactly the same element count, by order. Suppose, moreover, that G is solvable. Then H is solvable. This conjecture can be interpreted as saying that it is, in principle, possible to recognise whether or not a group is solvable simply by knowing the number of elements in the group of each different order. Note, that I say “in principle”, as it is not proposing an algorithm for recognising solvability in this way – that is a harder question. By way of comparison, it is easy to see that there is an algorithm to recognise nilpotency by knowing the number of elements in the group of each different order – one simply tests whether, for each prime p dividing the order of the group, the number of elements of order a power of p is equal to the highest power of p dividing the order of the group. If this is true for all p, then the group has a unique Sylow p-subgroup for each prime p dividing its order, and this property characterises nilpotency. As I understand it, Thompson’s conjecture has been proved… but I’m not sure by whom. If anyone could point me to a source, I’d like to give appropriate credit! I don’t know if an algorithm for recognising solvability in this way has ever been written down. I’m also unable to point to the place where Thompson first made the observation about these subgroups of $M_{23}$ and where he first stated this conjecture; again any help with sources would be appreciated.On the subgroup lattice of a group2018-11-20T00:00:00+00:002018-11-20T00:00:00+00:00https://nickpgill.github.io/on-the-subgroup-lattice<p>A couple of months ago, I went to a very enjoyable <a href="https://groupsinflorence2.wordpress.com/">conference in Florence</a>. During the course of this conference, I found myself stood in a coffee queue next to Peter Pal Palfy, whom I had heard of but never had the privilege of meeting. I want to recount a very interesting bit of maths that he told me about while we were in that queue – although it concerns a very natural group theory question, I had never heard of it before.</p>
<p>Anyone who has done a little bit of group theory is familiar with the subgroup lattice of a group. This question concerns what can happen between a <em>second-maximal subgroup</em> of a group <em>G</em>, and the group <em>G</em> itself.</p>
<p>A <strong>second-maximal subgroup</strong>, <em>H</em>, of <em>G</em> is a group that is maximal in the lattice of subgroups of <em>G</em>, once we have removed <em>G</em> itself, along with all maximal subgroups of <em>G</em>. By definition, the only proper subgroups that contain such a group <em>H</em> are maximal subgroups of <em>G</em>. So we have this set-up:</p>
<p><img src="lattice.jpg" alt="Lattice image" /></p>
<p>So, observe, that our second-maximal subgroup <em>H</em> lies inside precisely <em>n</em> maximal subgroups of <em>G</em>. Now, here’s the question: <em>what are the possibilities for the number n in the diagram?</em></p>
<p>For instance, is it possible to find a group <em>G</em> which has a second-maximal subgroup <em>H</em> that lies in precisely 8 maximal subgroups of <em>G</em>. If the answer is “yes” to this question, then let’s say that 8 is an <strong>sml-number</strong>.</p>
<p>A preliminary observation: If <em>G</em> is elementary abelian of order <em>p^2</em> for some prime <em>p</em>, then the trivial subgroup is second-maximal, and basic linear algebra says that it lies in precisely <em>1+p</em> maximal subgroups of <em>G</em>. Thus, <em>p+1</em> is an sml-number, for every prime <em>p</em>.</p>
<p>With a bit of ingenuity, one can generalize this example to conclude that <em>q+1</em> is an sml-number, for every prime power <em>q</em>. What is more one can construct these examples so that the groups in question are solvable. Now, here’s a neat partial converse, due to Palfy and Pudlak: <em>If H is a second-maximal subgroup of a solvable group G, then H is contained in q+1 maximal subgroups for some prime power q</em>.</p>
<p>For solvable groups, then, we have a complete answer. What about non-solvable groups? Here, the situation is still unclear. A 1983 paper of Walter Feit established that both 7 and 11 are sml-number – remarkably, he does this by exhibiting two different second maximal subgroups <em>H</em> of the alternating group <em>A_31</em>, one of which lies in exactly 7 maximals (here <em>H</em> is the normalizer of a Sylow 31-subgroup in <em>PSL(5,2)</em>), the other in 11 (here <em>H</em> is the normalizer of a Sylow 31-subgroup in <em>PSL(3,5)</em>).</p>
<p>Subsequent work by Lucchini has shown that all numbers of the form <em>q+2</em> are sml-numbers for <em>q</em> a prime power. He has exhibited other infinite families of sml-numbers, although as far as I know Feit’s examples remain sporadic.</p>
<p>To my knowledge, a complete answer still remains to be proven. I find it quite remarkable that such a basic question should throw up such bizarre and sporadic behaviour, and thereby resist a complete solution…</p>nickgillA couple of months ago, I went to a very enjoyable conference in Florence. During the course of this conference, I found myself stood in a coffee queue next to Peter Pal Palfy, whom I had heard of but never had the privilege of meeting. I want to recount a very interesting bit of maths that he told me about while we were in that queue – although it concerns a very natural group theory question, I had never heard of it before. Anyone who has done a little bit of group theory is familiar with the subgroup lattice of a group. This question concerns what can happen between a second-maximal subgroup of a group G, and the group G itself. A second-maximal subgroup, H, of G is a group that is maximal in the lattice of subgroups of G, once we have removed G itself, along with all maximal subgroups of G. By definition, the only proper subgroups that contain such a group H are maximal subgroups of G. So we have this set-up: So, observe, that our second-maximal subgroup H lies inside precisely n maximal subgroups of G. Now, here’s the question: what are the possibilities for the number n in the diagram? For instance, is it possible to find a group G which has a second-maximal subgroup H that lies in precisely 8 maximal subgroups of G. If the answer is “yes” to this question, then let’s say that 8 is an sml-number. A preliminary observation: If G is elementary abelian of order p^2 for some prime p, then the trivial subgroup is second-maximal, and basic linear algebra says that it lies in precisely 1+p maximal subgroups of G. Thus, p+1 is an sml-number, for every prime p. With a bit of ingenuity, one can generalize this example to conclude that q+1 is an sml-number, for every prime power q. What is more one can construct these examples so that the groups in question are solvable. Now, here’s a neat partial converse, due to Palfy and Pudlak: If H is a second-maximal subgroup of a solvable group G, then H is contained in q+1 maximal subgroups for some prime power q. For solvable groups, then, we have a complete answer. What about non-solvable groups? Here, the situation is still unclear. A 1983 paper of Walter Feit established that both 7 and 11 are sml-number – remarkably, he does this by exhibiting two different second maximal subgroups H of the alternating group A_31, one of which lies in exactly 7 maximals (here H is the normalizer of a Sylow 31-subgroup in PSL(5,2)), the other in 11 (here H is the normalizer of a Sylow 31-subgroup in PSL(3,5)). Subsequent work by Lucchini has shown that all numbers of the form q+2 are sml-numbers for q a prime power. He has exhibited other infinite families of sml-numbers, although as far as I know Feit’s examples remain sporadic. To my knowledge, a complete answer still remains to be proven. I find it quite remarkable that such a basic question should throw up such bizarre and sporadic behaviour, and thereby resist a complete solution…MSc thesis on matrix completion2018-10-05T00:00:00+00:002018-10-05T00:00:00+00:00https://nickpgill.github.io/2018/10/05/victor-tomno-msc-thesis<p><a href="http://users.mct.open.ac.uk/is3649/index.php">Ian Short</a> and I have had the great pleasure of helping to supervise Victor Tomno, an MSc student at Moi University, Kenya. Victor has just submitted his thesis entitled <em>The weakly sign symmetric P_{p,1}^+-matrix completion problem</em>; a copy is <a href="/MSc_VictorTomno.pdf">here</a>. I want to congratulate Victor on his hard work!</p>
<p>Victor’s work looks at the problem of taking a <em>partial matrix</em> (i.e. one which does not have all entries filled), and completing it to obtain a matrix with certain prescribed properties. In the course of this research, Victor used the theory of digraphs as well as a lot of linear algebra.</p>
<p>Ian and my involvement with Victor was facilitated by the <em>Mentoring African Research Mathematicians</em> programme of the London Mathematical Society; details of that scheme are <a href="https://www.lms.ac.uk/grants/mentoring-african-research-mathematics">here</a>. Ian and I held a 2 year grant which allowed us to visit with, and host, Kenyan mathematicians, one of whom was Victor. The grant finished up in September 2018, although Ian and my connection with Kenya endures through supervision of two PhD students. We would like to thank the LMS for their financial support – this collaboration has been a very rewarding experience for all involved.</p>
<p>I should note that, in the end, Ian and I removed ourselves from the list of Victor’s official supervisors, as Moi University regulations only allowed for two supervisors on an MSc thesis. Nonetheless we are very proud to be associated with Victor’s excellent work.</p>nickgillIan Short and I have had the great pleasure of helping to supervise Victor Tomno, an MSc student at Moi University, Kenya. Victor has just submitted his thesis entitled The weakly sign symmetric P_{p,1}^+-matrix completion problem; a copy is here. I want to congratulate Victor on his hard work! Victor’s work looks at the problem of taking a partial matrix (i.e. one which does not have all entries filled), and completing it to obtain a matrix with certain prescribed properties. In the course of this research, Victor used the theory of digraphs as well as a lot of linear algebra. Ian and my involvement with Victor was facilitated by the Mentoring African Research Mathematicians programme of the London Mathematical Society; details of that scheme are here. Ian and I held a 2 year grant which allowed us to visit with, and host, Kenyan mathematicians, one of whom was Victor. The grant finished up in September 2018, although Ian and my connection with Kenya endures through supervision of two PhD students. We would like to thank the LMS for their financial support – this collaboration has been a very rewarding experience for all involved. I should note that, in the end, Ian and I removed ourselves from the list of Victor’s official supervisors, as Moi University regulations only allowed for two supervisors on an MSc thesis. Nonetheless we are very proud to be associated with Victor’s excellent work.MMath thesis on Mathieu groups2018-04-06T00:00:00+00:002018-04-06T00:00:00+00:00https://nickpgill.github.io/2018/04/06/sam-hughes-mmath-dissertation<p>My MMath student, Sam Hughes, recently submitted his dissertation entitled “<em>Representation and character theory of the small Mathieu groups</em>”; a copy is <a href="/MMath_Sam.Hughes.pdf">here</a>.</p>
<p>The dissertation studies the ordinary (complex) character theory of <em>M<sub>11</sub></em> and <em>M<sub>12</sub></em>; it includes the foundations of character theory, as well as details on how to construct <em>M<sub>11</sub></em> and <em>M<sub>12</sub></em> via the notion of “transitive extension”. I think Sam has done a beautiful job and should be congratulated!</p>
<p>We are in the process of writing up a paper including some of Sam’s results. In fact the paper comes from a slightly different point of view. Our main result is the following:</p>
<p><strong>Theorem</strong></p>
<ol>
<li>If <em>G</em> is a sharply 5-transitive subgroup of Alt(12), then the character table of <em>G</em> is given by Table ***.</li>
<li>If <em>G</em> is a sharply 4-transitive subgroup of Alt(11), then the character table of <em>G</em> is given by Table ***.</li>
</ol>
<p>The point of this theorem is that we are able to construct the character table of <em>G</em> using only the assumption about multiple-transitivity – there is no direct reference to the Mathieu groups in this paper.</p>
<p>In the course of this research, I asked a question on MathOverflow <a href="https://mathoverflow.net/questions/293859/what-did-frobenius-prove-about-m-12">here</a>. Now seems a good time to thank the contributors to that discussion, especially Frieder Ladisch, for their help!</p>nickgillMy MMath student, Sam Hughes, recently submitted his dissertation entitled “Representation and character theory of the small Mathieu groups”; a copy is here. The dissertation studies the ordinary (complex) character theory of M11 and M12; it includes the foundations of character theory, as well as details on how to construct M11 and M12 via the notion of “transitive extension”. I think Sam has done a beautiful job and should be congratulated! We are in the process of writing up a paper including some of Sam’s results. In fact the paper comes from a slightly different point of view. Our main result is the following: Theorem If G is a sharply 5-transitive subgroup of Alt(12), then the character table of G is given by Table ***. If G is a sharply 4-transitive subgroup of Alt(11), then the character table of G is given by Table ***. The point of this theorem is that we are able to construct the character table of G using only the assumption about multiple-transitivity – there is no direct reference to the Mathieu groups in this paper. In the course of this research, I asked a question on MathOverflow here. Now seems a good time to thank the contributors to that discussion, especially Frieder Ladisch, for their help!