Title: Expansion Complexes I
Speaker: Dane Mayhook

One can construct a planar polygonal complex from a finite subdivision rule t by means of an expansion complex. In this talk I will show that any such expansion complex K can be amalgamated in accordance with t, and that this implies an array of results, including that K is combinatorially repetitive, exhibits a combinatorial hierarchy, and that the set of all expansion complexes associated to the subdivision rule t is precisely the local isomorphism class of K.