Combinatorial iterated integrals and the unipotent Torelli theorem for graphs
published: July 19, 2019, recorded: July 2019, views: 2
Report a problem or upload filesIf 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.
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 pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !