Combinatorial iterated integrals and the unipotent Torelli theorem for graphs

author: Eric Katz, Combinatorics and Optimization Department, University of Waterloo
published: July 19, 2019,   recorded: July 2019,   views: 73

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


The classical Torelli theorem says that a Riemann surface can be recovered from its Jacobian, which is a principally polarized Abelian variety. There is an analogous theorem for graphs, due to Artamkin and Caporaso–Viviani that the 2-isomorphism class of a graph can be recovered from its cycle space, equipped with its cycle pairing. We ask what happens when one considers mildly non-abelian data as in the unipotent Torelli theorem for Riemann surfaces due to Hain and Pulte. This leads us to introducing the analogue of iterated integrals on graphs and encoding them in a particular structure. This structure turns out to recover pointed bridgeless graphs up to isomorphism. We discuss some of the application of this result and connections to Hodge theory, tropical geometry, and number theory. This is joint work with Raymond Cheng.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: