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 171 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 32 tok/s Pro
GPT-5 High 36 tok/s Pro
GPT-4o 60 tok/s Pro
Kimi K2 188 tok/s Pro
GPT OSS 120B 437 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Unitary representations of real reductive groups (1212.2192v5)

Published 10 Dec 2012 in math.RT

Abstract: We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant Hermitian form as a deformation of one of the unitary representations in Harish-Chandra's Plancherel formula. The behavior of these deformations was determined to a first approximation in the Kazhdan-Lusztig analysis of irreducible characters; more complete information comes from the Beilinson-Bernstein proof of the Jantzen conjectures. The basic idea of our algorithm is to follow the behavior of the signature of the Hermitian form through this deformation, counting changes through singularities of the form at reducibility points. An important technical tool is replacing the classical invariant form (in which the real form of the Lie algebra acts by skew-adjoint operators) by forms in which the compact form of the Lie algebra acts by skew-adjoint operators.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

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

Collections

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