Papers
Topics
Authors
Recent
Search
2000 character limit reached

Vogan's Conjecture on local Arthur packets of $p$-adic $\mathrm{GL}_n$ and a combinatorial Lemma

Published 1 Nov 2023 in math.RT and math.NT | (2311.00249v1)

Abstract: For $\mathrm{GL}_n$ over a $p$-adic field, Cunningham and Ray proved Vogan's conjecture, that is, local Arthur packets are the same as ABV packets. They used the endoscopic theory to reduce the general case to a combinatorial lemma for irreducible local Arthur parameters, and their proof implies that one can also prove Vogan's conjecture for $p$-adic $\mathrm{GL}_n$ by proving a generalized version of this combinatorial lemma. Riddlesden recently proved this generalized lemma. In this paper, we give a new proof of it, which has its own interest.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.