Home > Research > Publications & Outputs > The nonsolvability by radicals of generic 3-con...
View graph of relations

The nonsolvability by radicals of generic 3-connected planar Laman graphs.

Research output: Contribution to journalJournal articlepeer-review

<mark>Journal publication date</mark>2007
<mark>Journal</mark>Transactions of the American Mathematical Society
Issue number5
Number of pages35
Pages (from-to)2269-2303
Publication StatusPublished
<mark>Original language</mark>English


We show that planar embeddable -connected Laman graphs are generically non-soluble. A Laman graph represents a configuration of points on the Euclidean plane with just enough distance specifications between them to ensure rigidity. Formally, a Laman graph is a maximally independent graph, that is, one that satisfies the vertex-edge count together with a corresponding inequality for each subgraph. The following main theorem of the paper resolves a conjecture of Owen (1991) in the planar case. Let be a maximally independent -connected planar graph, with more than 3 vertices, together with a realisable assignment of generic distances for the edges which includes a normalised unit length (base) edge. Then, for any solution configuration for these distances on a plane, with the base edge vertices placed at rational points, not all coordinates of the vertices lie in a radical extension of the distance field.

Bibliographic note

Copyright 2006, American Mathematical Society RAE_import_type : Journal article RAE_uoa_type : Pure Mathematics