The e-local character-counting conjecture for finite reductive groups

Let G{\mathbf{G}} be a finite reductive group with Frobenius map FF, let \ell be a prime, and let ee be the multiplicative order of qq modulo \ell (with the previously fixed notation). For an \ell-block BB of GF{\mathbf{G}}^F and d0d\geq 0, let kd(B){\mathbf{k}}^d(B) count its irreducible characters of defect dd, let kcd(B){\mathbf{k}}_{\rm c}^d(B) count its ee-cuspidal characters of defect dd, and let kd(Bσ){\mathbf{k}}^d(B_\sigma) count the corresponding characters for the stabiliser of an ee-local chain σ\sigma.

The e-local counting conjecture. For every \ell-block BB of GF{\mathbf{G}}^F and d0d\geq 0,

kd(B)=kcd(B)+σ(1)σ+1kd(Bσ),{\mathbf{k}}^d(B)={\mathbf{k}}_{\rm c}^d(B)+\sum_{\sigma}(-1)^{|\sigma|+1}{\mathbf{k}}^d(B_\sigma),

where σ\sigma runs over representatives for the action of GF{\mathbf{G}}^F on the non-trivial descending chains of ee-split Levi subgroups. This is proposed as a geometric, ee-local analogue of Dade's character-counting conjecture for finite reductive groups; its resolution status is not specified in the source.

Sources & referencesView supporting material

Primary source

Damiano Rossi, “Counting conjectures and e-local structures in finite reductive groups”, arXiv:2204.00428 (2022).

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.