时间： 2025.09.22 Mon, 15:00-18:00
Venue: Room 910
报告人： Anton Khoroshkin, Higher School of Economics
摘要：
Given a finite, simple, connected graph G, the “graphical configuration space” on X consists of collections of points (or small discs) in indexed by the vertices of G, where points corresponding to adjacent vertices are required to be distinct. For X=R^d, the union of these spaces over all possible graphs assembles into an algebraic structure extending the operad of little discs, called the “little discs contractad”.
In this talk, I will give a brief overview of which familiar properties of operads and ordinary configuration spaces do and do not extend to the case of all graphs. As an application, I will present several elegant formulas for the generating series of chromatic polynomials and Hamiltonian paths in complete multipartite graphs.
The talk is based on joint work with my student Denis Lyskov.
简体中文 
English