**Monday, April 19,** **3pm ET** (8pm BST, 7am Tue NZST)**Daniel Bernstein**, MIT**Rigidity of symmetry-forced frameworks**

**YouTube:**https://youtu.be/s7U8KrAAKNI

**Blog post**: http://matroidunion.org/?p=3675

**Abstract:**

The fundamental problem in rigidity theory is to determine whether a given immersion of a graph into $\mathbb{R}^d$ can be continuously deformed, treating the edges as rigid bars that can move freely about their incident vertices. Rigidity is a generic property of each fixed graph $G$, in the sense that almost all immersions of $G$ into $\mathbb{R}^d$ are rigid, or almost all immersions are flexible. The graphs that are generically rigid in $\mathbb{R}^d$ are the spanning sets of a certain matroid. The main result of my talk will be about rigidity in the plane when the graphs and their immersions have certain symmetry constraints.