5
$\begingroup$

Let $G$ be a finite group. It admits finitely many irreducible complex representations $H_1, \dots, H_r$ which generate, for $\oplus$ and $\otimes$, the Grothendieck ring $\mathcal{G}(G)$ of $G$ (also called its fusion ring).
The tensor product of irreducible representations decomposes into direct sum as follows: $$H_i \otimes H_j = \bigoplus_k M_{ij}^k \otimes H_k$$ with $M_{ij}^k$ the multiplicity space. The Grothendieck ring is of multiplicity $m$ if $max_{i, j, k}(\dim(M_{ij}^k)) = m$.

For $G = A_5$ we get the following dimensions:

enter image description here

and for $G = A_1(7)$, we get:

enter image description here

We observe that $\mathcal{G}(A_5)$ is of multiplicity two, and $\mathcal{G}(A_1(7))$ of multiplicity three.

I've checked (with GAP) that for $\vert G \vert < 10^4$ (nonabelian simple), then $\mathcal{G}(G)$ is not multiplicity one.

Question: Is there a nonabelian finite simple group with Grothendieck ring of multiplicity one?
If no by using CFSG, can we expect a direct proof?

Remark: Suppose $\dim(H_1) \le \dim(H_2) \le \dots \le \dim(H_r)$, then there is the necessary condition:
If the multiplicity is one then $\dim(H_r)^2 \le \sum_i \dim(H_i)$. Perhaps there is no nonabelian finite simple group verifying this weaker condition, which is easier to check (I've used it for $\vert G \vert < 10^4$).

$\endgroup$
1

1 Answer 1

5
$\begingroup$

There may be some clever trick to do this by elementary arguments, but I don't see it at the moment. With CFSG, the following argument shows that it is likely to be rare to have a Grothendieck ring with multiplicity $1$, if it happens at all. Let $b$ the the largest character degree of the non-Abelian finite simple group $G$, and suppose that $G$ has $k$ conjugacy classes. It is conjectured that $|G| <b^{3}$, and it has been proved by Cossey,Halasi,Maroti and Nguyen (using CFSG) that $|G| <b^{4}$. It has been proved by Fulman and Guralnick (again using CFSG) that $k < |G|^{0.41}$.

Your last inequality ( together with Cauchy_Schwarz) gives $b^{2} < \sqrt{k}\sqrt{|G|}$, so using the Fulman-Guralnick result, $b < |G|^{0.3525}$. Certainly $kb^{2} > |G|$, so we must have $k > |G|^{0.295}$. This last inequality can be achieved ( eg in ${\rm SL}(2,2^{n})$), but it seems likely to be relatively rare ( though precise checking may be painful).

Later edit: In fact, it is interesting to note that when $G = {\rm SL}(2,2^{n}) (n \geq 2)$, if we let $\chi$ denote the Steinberg character (which has degree $2^{n}$, whereas the largest irreducible character degree is $2^{n}+1$), we always .have $\chi \chi = \sum_{ \mu \in {\rm Irr}(G)} \mu$. This is because the projective cover of the (characteristic $2$) trivial module has dimension $2^{2n}-2^{n}$, and occurs as a summand of ${\rm St} \otimes {\rm St}.$

$\endgroup$
7
  • 1
    $\begingroup$ Do you mean "positive" rather than "negative" in the first sentence? Aside from that, I agree that CFSG is most likely to be needed here. $\endgroup$ Mar 25, 2015 at 12:36
  • $\begingroup$ Is the conjecture $\vert G \vert <b^3$ optimal? Because by your answer, multiplicity one implies $\vert G \vert > b^{2.8368}$. $\endgroup$ Mar 25, 2015 at 12:45
  • $\begingroup$ It is not far from optimal in general ( again, ${\rm SL}(2,2^{n})$ is not far from achieving it). $\endgroup$ Mar 25, 2015 at 12:53
  • $\begingroup$ @JimHumphreys : Oops, sorry, you were right, I misunderstood the sense. $\endgroup$ Mar 25, 2015 at 12:58
  • 1
    $\begingroup$ @GeoffRobinson: Your inequalities $k b^2 > |G|$ and $k |G| > b^4$ imply $k > b$ (after multiplying the first inequality by $k$). This is (conjecturally) stronger than your conclusion $k > |G|^{0.295}$. Can the stronger inequality ever be satisfied by a simple group? (It seems that $\mathrm{SL}(2,2^n)$ doesn't quite make it.) $\endgroup$ Mar 25, 2015 at 17:53

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.