Ivan Chio, UR
2:00 PM - 3:00 PM
Associated to any finite simple graph is the chromatic polynomial , which has the property that for any integer , is the number of proper coloring of . A hierarchical lattice is a sequence of graphs built recursively under a generating graph. For each , let be the probability measure
We prove that if the generating graph is 2-connected, then the sequence of measures converges to some measure , called the limiting measure of chromatic zeros for . For the Diamond Hierarchical Lattice (DHL), we show that its limiting measure has Hausdorff dimension 2.
The main techniques come from holomorphic dynamics and arithmetic dynamics. In particular we prove a new equidistribution result that relates the chromatic zeros of a hierarchical lattice to the bifurcation/activity current associated to a particular marked point. This is joint work with Roland Roeder.
Event contact: c dot d dot haessig at rochester dot edu