Arthur's packet conjectures for real reductive groups
Arthur's packet conjectures for real reductive groups
Let be an Arthur parameter, let be its associated Langlands parameter, and let denote the corresponding -packet. Define
the component group of the stabilizer of . Arthur's packet conjectures. For each , there should be a set and a function
such that , the virtual representation
is stable, the analogous virtual representations
are defined for , and every member of is unitary. Adams, Barbasch, and Vogan proved that their definitions satisfy most of these conjectures, including (i) and (ii), so this candidate is solved as stated in the source.
Sources & referencesView supporting material
Primary source
Jeffrey Adams, Andrei Ionov, Lucas Mason-Brown and David Vogan, “The Unitarity of Arthur Packets for Real Reductive Groups”, arXiv:2606.01609 (2026).
Additional references
11 papers in this index state this conjecture (2012–2026). The statement above is taken from the most recent of them; the others are arXiv:2602.19382, arXiv:2405.17375, arXiv:2309.12413, arXiv:2210.00251, arXiv:2204.04994, arXiv:2202.03585, arXiv:2111.07591, arXiv:2103.11538, arXiv:1807.03988, arXiv:1207.0724.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.