Dominance monotonicity conjecture for unipotent tensor squares

At least 2 years old · documented by

Let nn be a positive integer, let μ\mu and μ′\mu' be partitions of nn, and let τ\tau be a partition of nn. Write

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)}.

For partitions of nn, let μ′⊴μ\mu'\trianglelefteq\mu mean that μ′\mu' is below μ\mu in dominance order. Dominance monotonicity conjecture. If U(μ,μ,τ)(q)≠0U_{(\mu,\mu,\tau)}(q)\neq 0 for every partition τ\tau of nn, then U(μ′,μ′,τ)(q)≠0U_{(\mu',\mu',\tau)}(q)\neq 0 for every partition τ\tau of nn and every partition μ′⊴μ\mu'\trianglelefteq\mu. This is presented as a consequence of the first part of the preceding conjecture, since dominance below a partition with first part at most ⌈n/2⌉\lceil n/2\rceil preserves that bound. It therefore remains conjectural in the paper.

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.