ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG 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 F\mathcal{F} be the recursively defined family of graphs constructed in the paper.

The authors' rigid-graph characterization conjecture. The following statements are equivalent:

(a)G is quadratically solvable,(b)G is radically solvable,(c)G∈F.\begin{array}{ll} \text{(a)} & G\text{ is quadratically solvable},\\ \text{(b)} & G\text{ is radically solvable},\\ \text{(c)} & G\in\mathcal{F}. \end{array}

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.