Karen Yeats, Combinatorics and Optimization, University of Waterloo
“An arithmetic graph invariant with applications in quantum field theory.”
I will give an overview of things we know about c2 invariant of a graph. This is an invariant investigated principally by Brown and Schnetz which comes from counting points on the hypersurface defined by the Kirchhoff polynomial of a graph. This invariant predicts many properties of the Feynman integral of the graph. It connects with deep things like modular forms. Many computations involving it come down to playing around with polynomials defined from the graph and so its also combinatorial. The fun of it comes from the interplay of these things.
MC 5413