2026-09-20T01:12:20Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/344822022-01-13T07:54:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
David A. Vogan, Jr.
McCarthy, Nicholas (Nicholas Aaron)
Massachusetts Institute of Technology. Dept. of Mathematics.
Massachusetts Institute of Technology. Department of Mathematics
2006-11-07T12:27:51Z
2006-11-07T12:27:51Z
2005
2005
http://hdl.handle.net/1721.1/34482
70785122
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.
Includes bibliographical references (p. 91).
We provide two algorithms to solve branching from K to M for the real split reductive group of type A, one inductive and one related to semistandard Young tableaux. The results extend to branching from Ke to M Ke for the real split reductive groups of type Bn and Dn.
by Nicholas McCarthy.
S.M.
91 p.
3771837 bytes
3775584 bytes
application/pdf
application/pdf
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.
Branching from K to M for split classical groups
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="6650950b-145a-42c6-9521-884b87468b14">
<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>Branching from K to M for split classical groups</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2005</PublicationDate>
<Authors>
<Author>
<DisplayName>McCarthy, Nicholas (Nicholas Aaron)</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>We provide two algorithms to solve branching from K to M for the real split reductive group of type A, one inductive and one related to semistandard Young tableaux. The results extend to branching from Ke to M Ke for the real split reductive groups of type Bn and Dn.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>