Full heaps over Dynkin diagrams of type affine a

摘要

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 a n. They are exactly the extended slant lattices defined by Hagiwara.