Papers
Topics
Authors
Recent
Search
2000 character limit reached

Harish-Chandra's admissibility theorem and beyond

Published 29 Dec 2024 in math.RT and math.DG | (2412.20387v1)

Abstract: This article is a record of the lecture at the centennial conference for Harish-Chandra. The admissibility theorem of Harish-Chandra concerns the restrictions of irreducible representations to maximal compact subgroups. In this article, we begin with a brief explanation of two directions for generalizing his pioneering work to {\it{non-compact}} reductive subgroups: one emphasizes discrete decomposability with the finite multiplicity property, while the other focuses on finite/uniformly bounded multiplicity properties. We discuss how the recent representation-theoretic developments in these directions collectively offer a powerful method for the new spectral analysis of standard locally symmetric spaces, extending beyond the classical Riemannian setting.

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 (1)

Collections

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