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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, 5 figures

Keywords

Combinatorics, 68U07, 12F10, 05C40 (primary), 52C25, 13P99 (secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/74736

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0503717
 http://arxiv.org/abs/math/0503717

Collections

arXiv