Events by date

Title: Quasi-popular Matchings, Optimality, and Extended Formulations

Abstract:

The goal of this talk is to obtain efficient algorithms for computing desirable matchings (wrt cost) by paying the price of mildly relaxing popularity.

Title: Feynman graphs to chord diagrams

Abstract:

I will explain how classic techniques of algebraic combinatorics can, via chord diagrams, tell us about the leading log, next-to-leading log, etc, expansions in quantum field theory, and what we think chord diagrams can tell us about individual Feynman graphs as well.