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.
| Identifer | oai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/34482 |
| Date | January 2005 |
| Creators | McCarthy, Nicholas (Nicholas Aaron) |
| Contributors | David A. Vogan, Jr., Massachusetts Institute of Technology. Dept. of Mathematics., Massachusetts Institute of Technology. Dept. of Mathematics. |
| Publisher | Massachusetts Institute of Technology |
| Source Sets | M.I.T. Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis |
| Format | 91 p., 3771837 bytes, 3775584 bytes, application/pdf, application/pdf, application/pdf |
| 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., http://dspace.mit.edu/handle/1721.1/7582 |
Page generated in 0.0019 seconds