Distance Configurations of Points in a Plane with a Galois group that is not Soluble
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。