Papers
Topics
Authors
Recent
Search
2000 character limit reached

The explicit Zelevinsky-Aubert duality

Published 13 Aug 2020 in math.RT and math.NT | (2008.05689v2)

Abstract: In this paper, we give an explicit computable algorithm for the Zelevinsky-Aubert dual of irreducible representations of $p$-adic symplectic and odd special orthogonal groups. To do this, we establish explicit formulas for certain derivatives and socles. We also give a combinatorial criterion for the irreducibility of certain parabolically induced representations.

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.

Authors (2)

Collections

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