92 citations · 104 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2005
Distance Configurations of Points in a Plane with a Galois group that is not Soluble
John C. Owen, Stephen C. Power
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…
math.CO2003★ 2 cited
Generic 3-connected planar constraint systems are not soluble by radicals
John C. Owen, Stephen C. Power
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…