145 citations
- Eötvös Loránd UniversityHU4 papers
- Princeton UniversityUS2 papers
- Brown UniversityUS1 paper
- Cornell UniversityUS1 paper
- Harvard UniversityUS1 paper
- Laboratoire de Mathématiques Blaise PascalFR1 paper
- Lancaster and Morecambe CollegeGB1 paper
- Livestock & Meat CommissionGB1 paper
- Max Planck Institute for the Physics of Complex SystemsDE1 paper
- O.Ya. Usikov Institute for Radiophysics and ElectronicsUA1 paper
- Qinetiq (United Kingdom)GB1 paper
- Syracuse UniversityUS1 paper
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…