BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260920T212416Z
UID:Seminar-MIF-1436@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Othon Michail:MAILTO:Othon.Michail@liverpool.ac.uk
DTSTART:20240618T130000
DTEND:20240618T140000
SUMMARY:MIF Series
DESCRIPTION:Anthony Nixon: Quotient graphs of symmetrically rigid frameworks.\n\nA bar-joint framework (G,p) is the combination of a finite simple graph G = (V,E) and a map p assigning positions in Euclidean d-space to the vertices and hence lengths to the edges. The framework is flexible if there exists an edge-length-preserving continuous deformation of the vertices that does not arise from an isometry of the space. If no such deformation exists then the framework is rigid. In recent years many groups have extended rigidity theoretic results to symmetric frameworks motivated, e.g., by applications to crystals. In particular we concentrate on the following question. Given a graph G with a non-trivial automorphism group and a framework (G, p) which is realised with the corresponding symmetry group, does there exist a deformation that preserves the symmetry of the framework? Detailed combinatorial characterisations of symmetric rigidity are known for a range of symmetry groups in the plane. After giving a gentle introduction to the general subject of rigidity I will report on joint work with Dewar, Grasegger and Kastis where we provide a variety of combinatorial and probabilistic results for symmetric frameworks in d-dimensions.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1436
LOCATION:
END:VEVENT
END:VCALENDAR