Distance Configurations of Points in a Plane with a Galois group that is not Soluble

2005/03/30 by J. C. Owen, John C. Owen, S. C. Power +3
Computer Science · Engineering · Mathematics · #Advanced Theoretical and Applied Studies in Material Sciences and Geometry #Computational Geometry and Mesh Generation #Structural Analysis and Optimization #math.CO #msc:05C40 #msc:12F10 #msc:13P99 #msc:52C25 #msc:68U07

paper · pdf · doi:10.48550/arxiv.math/0503717

14 pages, 5 figures

arxiv created 2005/03/30 · arxiv updated 2009/12/01

Abstract

We have conjectured that the constraint equations defined by a generic Laman graph are not soluble by radicals when the graph is 3-connected. We prove that this conjecture follows from the following simpler conjecture: the constraint equations defined by a generic Laman graph are not soluble by radicals if the graph does not contain a proper subgraph which is itself a Laman graph.

Related

• Generic 3-connected planar constraint systems are not soluble by radicals
• Exact certification of the coordinate fields of the triangle-free Exoo-Ismailescu unit-distance graphs EI17 and EI19 (HoG 51375, 51376): a solvable-non-solvable dichotomy (origami vs. S20) and the Laman-number conjecture
• A 3-manifold group which is not four dimensional linear
• Towards the essence of Šoltés' problem
• Generalized point configurations in \mathbb F_q^d