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

Simple item page
dc.creatorOwen, John C.
dc.creatorPower, Stephen C.
dc.date2005-03-30
dc.date.accessioned2026-07-07T05:18:39Z
dc.date.available2026-07-07T05:18:39Z
dc.descriptionWe 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.
dc.description14 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/math/0503717
dc.identifierhttp://arxiv.org/abs/math/0503717
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74736
dc.subjectCombinatorics
dc.subject68U07, 12F10, 05C40 (primary), 52C25, 13P99 (secondary)
dc.titleDistance Configurations of Points in a Plane with a Galois group that is not Soluble
dc.typetext

Files

Collections

arXiv