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

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

2005-03-30

arxiv.org/abs/math/0503717v1

Mathematics

Combinatorics

14 pages, 5 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Distance Configurations of Points in a Plane with a Galois group that is not Soluble does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Distance Configurations of Points in a Plane with a Galois group that is not Soluble, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distance Configurations of Points in a Plane with a Galois group that is not Soluble will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-439435