## Rigidity of graphsAdd to your list(s) Download to your calendar using vCal - Anthony Nixon, Lancaster
- Thursday 13 October 2022, 15:00-16:00
- LTC.
If you have a question about this talk, please contact Johannes Carmesin. A (bar-joint) framework is the combination of a graph G and a map p assigning positions in Euclidean d-space to the vertices of G. The vertices are modelled as universal joints and the edges as stiff bars. The framework is rigid if the only edge-length-preserving continuous deformation of the vertices arises from an isometry of the space. While it is computationally difficult to determine if a given framework is rigid, the generic behaviour depends only on the graph. Indeed, when d=1, G is rigid if and only if it is connected, and when d=2, a precise combinatorial description was obtained by Polaczek-Geiringer in the 1920s. However, giving a combinatorial description in all higher dimensions remains open 100 years later. The talk will survey graph rigidity and then report on recent joint work on a particular special case as well as an application to maximum likelihood estimation. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsdddd Dinner Table Terrorism - Achieving Food Security Type the title of a new list here## Other talksStructured Decompositions: recursive data and recursive algorithms [Colloquium:] Aperture Fever: The Extremely Large Telescope Solar Physics: more to come ! Hidden Markov Model in Multiple Testing on Dependent Data TBC (Special colloquium): Quantum enhanced superresolution confocal microscopy |