2026-09-20T19:12:07Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/437962022-01-13T07:54:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Michael J. Hopkins and David A. Vogan.
Havlíčková, Markéta
Massachusetts Institute of Technology. Dept. of Mathematics.
Massachusetts Institute of Technology. Department of Mathematics
2008-12-11T18:29:00Z
2008-12-11T18:29:00Z
2008
2008
http://hdl.handle.net/1721.1/43796
261345009
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2008.
Includes bibliographical references (p. 75-76).
Abstract: 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.
by Markéta Havlíčková.
Ph.D.
76 p.
eng
Massachusetts Institute of Technology
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.
http://dspace.mit.edu/handle/1721.1/7582
Mathematics.
Boundaries of K-types in discrete series
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="fcc35bdc-35a4-4749-a0d8-d546c9ca09ee">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Boundaries of K-types in discrete series</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2008</PublicationDate>
<Authors>
<Author>
<DisplayName>Havlíčková, Markéta</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics.</Keyword>
<Abstract>Abstract: 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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>