Full Heaps over Dynkin Diagrams of Affine Type AZ. Strider McGregor-Dorsey, CU |
September 2 AbstractA full heap is an isomorphism class of partially ordered sets with labeling taken from some underlying labeled graph, satisfying certain conditions. A Dynkin diagram is graph which encodes, via a set of rules, a generalized Cartan matrix. In this talk, we classify all the full heaps over Dynkin diagrams of affine type A, defining and giving examples of these structures along the way. There will be lots of pictures. |