一个Laman图的实现数
The number of realizations of a Laman graph
摘要：
拉曼图模型的平面框架是刚性的顶点之间的距离的一般选择。在平面上有很多方法可以实现一个Laman图，直到等距。这样的实现可以看作是规定点对之间距离的二次方程组的解。利用代数和热带几何的思想，我们提供了一个递归公式的复杂的解决方案，这样的系统的数量。
英文摘要：
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of systems of quadratic equations prescribing the distances between pairs of points. Using ideas from algebraic and tropical geometry, we provide a recursive formula for the number of complex solutions of such systems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
