Level-rank conjecture for finite reductive groups

Keep qq, G\mathbf{G}, and FF fixed. Let (L,λ)(L,\lambda) be a Φl\Phi_l-cuspidal pair and (M,μ)(M,\mu) a Φm\Phi_m-cuspidal pair, for separate positive integers ll and mm, and fix primitive roots of unity ζl\zeta_l and ζm\zeta_m of orders ll and mm. Let Irr(WL,λG)M,μ\operatorname{Irr}(W_{L,\lambda}^G)_{M,\mu} and Irr(WM,μG)L,λ\operatorname{Irr}(W_{M,\mu}^G)_{L,\lambda} be the images of

Irr(WL,λG)χL,λUch(G)L,λUch(G)M,μχM,μIrr(WM,μG).\operatorname{Irr}(W_{L,\lambda}^G) \xleftarrow{\chi_{L,\lambda}} \operatorname{Uch}(G)_{L,\lambda}\cap\operatorname{Uch}(G)_{M,\mu} \xrightarrow{\chi_{M,\mu}} \operatorname{Irr}(W_{M,\mu}^G).

Level-rank conjecture. The two image sets are unions of HL,λG(ζm)H_{L,\lambda}^G(\zeta_m)- and HM,μG(ζl)H_{M,\mu}^G(\zeta_l)-blocks, respectively; the bijection between them induced by χL,λ\chi_{L,\lambda} and χM,μ\chi_{M,\mu} respects blocks and descends to a bijection

{HL,λG(ζm)-blocks aIrr(WL,λG)M,μ}{HM,μG(ζl)-blocks bIrr(WM,μG)L,λ}.\{\text{$H_{L,\lambda}^G(\zeta_m)$-blocks $\mathbf{a}\subseteq\operatorname{Irr}(W_{L,\lambda}^G)_{M,\mu}$}\}\xrightarrow{\sim}\{\text{$H_{M,\mu}^G(\zeta_l)$-blocks $\mathbf{b}\subseteq\operatorname{Irr}(W_{M,\mu}^G)_{L,\lambda}$}\}.

Moreover, if χM,μL,λ(a)=b\chi_{M,\mu}^{L,\lambda}(\mathbf{a})=\mathbf{b}, then the bijection ab\mathbf{a}\xrightarrow{\sim}\mathbf{b} is categorified by an equivalence

Db(OWL,λG(νl)a)Db(OWM,μG(νm)b)\mathsf{D}^b(\mathsf{O}_{W_{L,\lambda}^G}(\vec{\nu}_l)_\mathbf{a})\simeq\mathsf{D}^b(\mathsf{O}_{W_{M,\mu}^G}(\vec{\nu}_m)_\mathbf{b})

for any vectors νl,νm\vec{\nu}_l,\vec{\nu}_m related to a,b\mathbf{a},\mathbf{b} by the stated numerical conditions. This proposes a level-rank correspondence simultaneously at the level of blocks and highest-weight covers; the source does not provide a resolution.

Sources & referencesView supporting material

Primary source

Minh-Tâm Quang Trinh and Ting Xue, “Level-Rank Dualities for Finite Reductive Groups”, arXiv:2508.07051 (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.