Conjecture on unipotent tensor squares for GL(n,q)

About 3 years old · traced to

Let nn be a positive integer, let μ=(μ1,μ2,… )\mu=(\mu_1,\mu_2,\dots) be a partition of nn, and let τ\tau be a partition of nn. For triples of partitions define

U(μ,μ,τ)(q):=⟨Uμ⊗Uμ⊗Uτ,1⟩GLn(Fq),U_{(\mu,\mu,\tau)}(q):=\left\langle\mathcal{U}^{\mu}\otimes\mathcal{U}^{\mu}\otimes\mathcal{U}^{\tau},1\right\rangle_{{\rm GL}_n(\mathbb{F}_q)},

where Uλ\mathcal{U}^{\lambda} denotes the unipotent character of GLn(Fq){\rm GL}_n(\mathbb{F}_q) indexed by λ\lambda. The unipotent tensor-square conjecture. (i) U(μ,μ,τ)(q)≠0U_{(\mu,\mu,\tau)}(q)\neq 0 for every partition τ\tau of nn if and only if μ1≤⌈n/2⌉\mu_1\leq\lceil n/2\rceil. (ii) If μ1>⌈n/2⌉\mu_1>\lceil n/2\rceil, then

U(μ,μ,(1n))(q)=0.U_{(\mu,\mu,(1^n))}(q)=0.

This gives a conjectural necessary and sufficient condition for a unipotent character's tensor square to contain every unipotent character. The claim is verified experimentally for n≤8n\leq 8; the paper proves the staircase case but leaves the general criterion open.

References

Primary source

Emmanuel Letellier and GyeongHyeon Nam, “Saxl conjecture and the tensor square of unipotent characters of GL(n,q)”, arXiv:2312.09157 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.