Irreducible genuine characters of the Metaplectic group: Kazhdan-Lusztig algorithm and Vogan duality

Research output: Contribution to journalArticlepeer-review

Abstract

We establish a Kazhdan-Lusztig algorithm to compute characters of irreducible genuine representations of the (nonlinear) metaplectic group with half-integral infinitesimal character. We then prove a character multiplicity duality theorem for representations of Mp(2n, ℝ) at fixed half-integral infinitesimal character. This allows us to extend some of Langlands' ideas to Mp(2n, ℝ).

Original languageEnglish
Pages (from-to)245-295
Number of pages51
JournalRepresentation Theory
Volume4
Issue number10
DOIs
Publication statusPublished - 31 Jul 2000
Externally publishedYes

Fingerprint

Dive into the research topics of 'Irreducible genuine characters of the Metaplectic group: Kazhdan-Lusztig algorithm and Vogan duality'. Together they form a unique fingerprint.

Cite this