Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 93 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 33 tok/s Pro
GPT-4o 128 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 449 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

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

Published 1 Nov 2023 in math.RT and math.NT

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.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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