A full heap is an infinite partially ordered set with labeling taken from the nodes of an underlying Dynkin diagram, satisfying certain conditions intended to capture the structure of that diagram. In the present thesis, we classify all full heaps over Dynkin diagrams of type Ā n. They are exactly the extended slant lattices defined by Hagiwara.
|Advisor:||Green, Richard M.|
|School:||University of Colorado at Boulder|
|School Location:||United States -- Colorado|
|Source:||MAI 47/05M, Masters Abstracts International|
|Keywords:||Algebraic combinatorics, Cyclic dynkin diagrams, Extended slant lattices, Full heaps, Heaps, Lie algebra|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be