The authors' characterization of radically solvable rigid graphs
Statement
Let be a rigid graph. A graph is quadratically solvable if a generic framework can be solved using quadratic extensions, and radically solvable if a generic framework can be solved using radical extensions. Let be the recursively defined family of graphs constructed in the paper.
The authors' rigid-graph characterization conjecture. The following statements are equivalent:
The paper proves the corresponding statement for planar graphs. It explains that the conjecture is equivalent to the 3-connected conjecture above, so the unresolved issue is the removal of planarity.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.