Conjectural classification of scattered representations with Dirac cohomology

About 9 years old · traced to

For a complex simple Lie group GG, let G^sd\widehat{G}^{\mathrm{sd}} denote the scattered part of the unitary dual with nonzero Dirac cohomology. Representations are encoded by the displayed tuples, and [x][x] denotes the integer part of xx; for admissible pairs (a,b)(a,b) define

p(a,b):=max⁡{b−a−1,0}.p(a,b):=\max\{b-a-1,0\}.

Scattered-representation classification conjecture. The set G^sd\widehat{G}^{\mathrm{sd}} can be described as follows:

  • A^2n−1sd\widehat{A}_{2n-1}^{\mathrm{sd}} is empty, while A^2nsd\widehat{A}_{2n}^{\mathrm{sd}} consists of the nn representations
[2,…,2⏟p,1,…,1⏟2n−2p,2,…,2⏟p],0≤p≤n−1.[\underbrace{2,\dots,2}_{p},\underbrace{1,\dots,1}_{2n-2p},\underbrace{2,\dots,2}_{p}],\qquad 0\leq p\leq n-1.
  • B^nsd\widehat{B}_n^{\mathrm{sd}} consists of the [n/2][n/2] representations
[2,…,2⏟p(a,b),1,…,1⏟n−p(a,b)−1,2],[\underbrace{2,\dots,2}_{p(a,b)},\underbrace{1,\dots,1}_{n-p(a,b)-1},2],

where a+b=na+b=n, b≥a≥1b\geq a\geq1.

  • C^2n−1sd\widehat{C}_{2n-1}^{\mathrm{sd}} is empty, while C^2nsd={πmin}\widehat{C}_{2n}^{\mathrm{sd}}=\{\pi_{\mathrm{min}}\}, where πmin\pi_{\mathrm{min}} is the minimal representation.
  • D^nsd\widehat{D}_n^{\mathrm{sd}} consists of the [n/4][n/4] representations
[2,…,2⏟p(a,b),1,…,1⏟n−p(a,b)],[\underbrace{2,\dots,2}_{p(a,b)},\underbrace{1,\dots,1}_{n-p(a,b)}],

where a+b=na+b=n, b≥a≥2b\geq a\geq2, and aa is even.

In particular, any representation in G^sd\widehat{G}^{\mathrm{sd}} is KK-multiplicity free. This conjectural classification follows calculations in low-rank examples and gives an explicit description of the scattered representations for the classical types; its general status is not resolved in the supplied text.

References

Primary source

Jian Ding and Chao-Ping Dong, “Unitary Representations with Dirac cohomology: a finiteness result for complex Lie groups”, arXiv:1702.01876 (2020).

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.