Previous Conferences & Workshops
Organizers: Nima Arkani-Hamed, June Huh, Thomas Lam, and Bernd
Sturmfels
This event aimed to foster collaboration between mathematicians
and physicists. The focus was on the intersection of combinatorial
geometry and fundamental physics, covering...
Spanning Trees of Simple Planar Graphs
Alex Kontorovich
We prove the exponential growth of the cardinality of the set of
numbers of spanning trees in simple planar graphs on n vertices,
answering a question from 1969. The proof uses a connection with
continued fractions and advances towards Zaremba’s...
2:30pm|Simonyi Hall 101 and Remote Access
The Asymptotic Mean Action and the Asymptotic Linking Number For Pseudo-Rotations
Abror Pirnapasov
1:00pm|Simonyi 101 and Remote Access
By the Birkhoff Ergodic Theorem, the asymptotic mean action of
an area-preserving map is defined almost everywhere. Bramham and
Zhang asked whether, if a map is a pseudo-rotation, its asymptotic
mean action is defined everywhere and is constant. In...
Quadratic Stability of the Brunn-Minkowski Inequality
10:30am|Simonyi 101 and Remote Access
The Brunn-Minkowski inequality is a fundamental result in convex
geometry controlling the volume of the sum of subsets of
$\mathbb{R}^n$. It asserts that for sets $A,B\subset
\mathbb{R}^n$ of equal volume and a parameter $t\in(0,1)$, we have
$|tA+...
Organizers: Nima Arkani-Hamed, June Huh, Thomas Lam, and Bernd
Sturmfels
This event aimed to foster collaboration between mathematicians
and physicists. The focus was on the intersection of combinatorial
geometry and fundamental physics, covering...
Hodge structures and representation theory
3:35pm|*Princeton University, Fine Hall 224*
Kazhdan-Lusztig theory provides a pattern of applying tools of
algebraic geometry,
such as the theory of Frobenius or Hodge weights, to numerical
problems of representation theory.
These techniques have been used in representation theory over a
field...
Induced Subgraphs and Pathwidth
Maria Chudnovsky
10:30am|Simonyi 101 and Remote Access
Tree decompositions, and in particular path decompositions, are
a powerful tool in both structural graph theory and graph
algorithms. Many hard problems become tractable if the input graph
is known to have a tree decomposition of bounded “width”...
Organizers: Nima Arkani-Hamed, June Huh, Thomas Lam, and Bernd
Sturmfels
This event aimed to foster collaboration between mathematicians
and physicists. The focus was on the intersection of combinatorial
geometry and fundamental physics, covering...
