Component Groups of Centralizers Corresponding to Unramified L-Packets
Public Deposited- Resource Type
- Creator
- Abstract
A theorem of Keys states that the cardinality of an unramified L-packet is equal to the order of a component group of a centralizer of a semi-simple element. We compute the component groups of centralizers in connected, quasi-simple, linear algebraic groups. We also compute the component groups for certain similitude groups.
- Subject
- Language
- Publisher
- Thesis Degree Level
- Thesis Degree Name
- Thesis Degree Discipline
- Identifier
- Rights Notes
Copyright © 2014 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Date Created
- 2014
Relations
- In Collection:
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
fraser-componentgroupsofcentralizerscorresponding.pdf | 2023-05-04 | Public | Download |