Rigid heptagon linkage
Complex Projective 4-Space 2020-12-31
Summary:
In January 2000, Erich Friedman considered the problem of finding a rigid unit-distance graph G containing a regular heptagon as a subgraph. That is to say, the graph is immersed in the plane such that: every edge of G must … Continue reading →