Radically solvable graphs
Combinatorics
2012-07-09 v1
Abstract
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge lengths. We show that the radical solvability of a generic framework depends only on its underlying graph and characterise which planar graphs give rise to radically solvable generic frameworks. We conjecture that our characterisation extends to all graphs.
Keywords
Cite
@article{arxiv.1207.1580,
title = {Radically solvable graphs},
author = {Bill Jackson and J. C. Owen},
journal= {arXiv preprint arXiv:1207.1580},
year = {2012}
}