04/05/2016 - 12:15pm

04/05/2016 - 1:10pm

Speaker:

Dagan Karp (HMC)

Abstract:

In this talk I'll report on work with Matthew Hin. What is the Euler characteristic of a graph? What is the genus of a graph? More basically, what is the cohomology of a graph? We define the cohomology of any finite graph, and provide an effective algorithm computing such. Our method involves graph associahedra and toric geometry.

Where:

Millikan 2099, Pomona College