REVIEW
Distance Configurations of Points in a Plane with a Galois group that is not Soluble
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Distance Configurations of Points in a Plane with a Galois group that is not Soluble
classification
math.CO
keywords
graphlamansolubleconjectureconstraintdefinedequationsgeneric
read the original abstract
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 from the following simpler conjecture: the constraint equations defined by a generic Laman graph are not soluble by radicals if the graph does not contain a proper subgraph which is itself a Laman graph.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.