Special Year Seminar II
Measures on Combinatorial Objects
Suppose given a class of finite combinatorial structures, such as graphs or total orders. Nate Harman and I recently introduced a notion of measure in this context: this is a rule assigning a number to each structure such that some axioms are satisfied. The purpose of this concept is that measures allow us to construct interesting new tensor categories. However, understanding measures seems to be a difficult combinatorial problem. I will explain some of what is known, and some of the major open problems.
Date & Time
April 10, 2025 | 10:00am – 11:00am
Location
Simonyi 101Speakers
Andrew Snowden, University of Michigan