Coupler curves of moving graphs and counting realizations of rigid graphs

Abstract: A calligraph is a graph that for almost all edge length assignments moves with one degree of freedom in the plane, if we fix an edge and consider the vertices as revolute joints. The trajectory of a distinguished vertex of the calligraph is called its coupler curve. Each calligraph corresponds to an algebraic series of real curves in the plane. I will present a description for the class of those curves in the Néron-Severi lattice of the plane blown-up at six complex conjugate points.

A graph is said to be minimally rigid if, up to rotations and translations, admits finitely many, but at least two, realizations into the plane for almost all edge length assignments. A minimally rigid graph can be expressed as a union of two calligraphs, and the number of its realizations is equal to the product of classes of those two calligraphs. I will show how one can apply those observations to produce an improved algorithm that counts the numbers of realizations. This, in turn, allows one to characterize invariants of coupler curves.

This is a joint work with Georg Grasegger and Niels Lubbes (Symbolic computation group, RICAM, Austria)

computational geometrydiscrete mathematicscommutative algebracombinatorics

Audience: researchers in the topic

Copenhagen-Jerusalem Combinatorics Seminar

Series comments: There is a mailing list for talk announcements. If you want to receive the announcements, send an e-mail to the organizer to subscribe to the mailing list.

The password for the zoom room is 123456