Abstract
dc:description.abstractAbstract: A fundamental problem about irreducible representations of a reductive Lie group G is understanding their restriction to a maximal compact subgroup K. In certain important cases, known as the discrete series, we have a formula that gives the multiplicity of any given irreducible K-representation (or K-type) as an alternating sum. It is not immediately clear from this formula which K-types, indexed by their highest weights, have non-zero multiplicity. Evidence suggests that the collection is very close to a set of lattice points in a noncompact convex polyhedron. In this paper we shall describe a recursive algorithm for finding the boundary facets of this polyhedron.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Dept. of Mathematics.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2008
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Havlíčková, Markéta
- Advisor dc:contributor.advisor
-
- Michael J. Hopkins and David A. Vogan.
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/43796
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/43796