TBD by Andrew Stuart
- Series
- School of Mathematics Colloquium
- Time
- Friday, April 23, 2027 - 11:00 for 1 hour (actually 50 minutes)
- Location
- TBD
- Speaker
- Andrew Stuart
Separator theorems are cornerstones of modern structural and algorithmic graph theory. Over the last few decades, researchers have developed various separator theorems for many different classes of graphs. The techniques underlying these results reveal deep and unexpected connections between different areas of math and computer science. In this talk, I will discuss a (biased) sample of a few separator theorems and sketch the techniques behind them.
In this talk we discuss two related notions for actions of (semi-)groups $G$ on compact metric spaces $X$. The first is the Glasner property: for every infinite subset $A$ of $X$ and every $\varepsilon>0$, there exists $g\in G$ such that $gA$ is $\varepsilon$-dense in $X$.
The second is the recently introduced notion of IC-rigidity, formulated in terms of the induced action of $G$ on the space $K(X)$ of compact subsets of $X$, equipped with the Hausdorff metric. An action is called IC-rigid if the only $G$-invariant Borel probability measure on $K(X)$ supported on infinite compact sets is the Dirac measure $\delta_X$.
We will discuss a Fourier-analytic criterion implying both IC-rigidity and the Glasner property and apply it to establish IC-rigidity for some semi-group actions on tori. We will then explain how a more general pair-correlation criterion can be used to prove IC-rigidity and the Glasner property for certain actions on compact homogeneous spaces.