Skip to Content

Search: {{$root.lsaSearchQuery.q}}, Page {{$root.page}}

Combinatorics Seminar

Unlabelled rigidity
Friday, February 22, 2019
3:00-4:00 PM
4088 East Hall Map
For a graph embedded in Euclidean space, when can you reconstruct the positions of the vertices from the lengths of the edges? The answer depends on the graph. Here we consider the unlabelled version of the problem, where the input is the unordered set of edge lengths, with no correspondence with the edges. We show that for generic configurations, the unlabelled rigidity problem is solvable when the labelled version is.

This is joint work with Steven Gortler and Louis Theran. Speaker(s): Dylan Thurston (Indiana U.)
Building: East Hall
Event Type: Workshop / Seminar
Tags: Mathematics
Source: Happening @ Michigan from Department of Mathematics, Combinatorics Seminar - Department of Mathematics