Generic 3-connected planar constraint systems are not soluble by radicals

Details Generic 3-connected planar constraint systems are not soluble by radicals Generic 3-connected planar constraint systems are not soluble by radicals

2003-11-04

arxiv.org/abs/math/0311037v1

Mathematics

Combinatorics

45 pages, 11 figures

Scientific paper

We show that planar embeddable 3-connected CAD graphs are generically non-soluble. A CAD graph represents a configuration of points on the Euclidean plane with just enough distance dimensions between them to ensure rigidity. Formally, a CAD graph is a maximally independent graph, that is, one that satisfies the vertex-edge count 2v - 3 = e together with a corresponding inequality for each subgraph. The following main theorem of the paper resolves a conjecture of Owen in the planar case. Let G be a maximally independent 3-connected planar graph, with more than 3 vertices, together with a realisable assignment of generic dimensions for the edges which includes a normalised unit length (base) edge. Then, for any solution configuration for these dimensions 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 dimension field.

Affiliated with

Also associated with

No associations

Rating

Generic 3-connected planar constraint systems are not soluble by radicals 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 Generic 3-connected planar constraint systems are not soluble by radicals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generic 3-connected planar constraint systems are not soluble by radicals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-265038