刚性图欧氏嵌入计数的代数方法
Algebraic methods for counting Euclidean embeddings of rigid graphs
摘要:
(最小)刚性图的研究受到许多应用的启发,主要是在机器人和生物信息学中。一个主要的开放问题涉及嵌入的数量,这样的图,刚性运动,在欧几里得空间。我们捕获嵌入的多项式系统具有适当的结构,使他们的混合体积,它的共同根的数量的界限,产生有趣的上界的嵌入的数量。我们集中在$\RR^2$和$\RR^3$,其中的Laman图和凸单纯多面体的1-λ,分别承认归纳Henneberg结构。我们建立了$\RR^3$的第一个下界约为$2.52^n$,其中$n$表示顶点数.此外,我们的实现产生上界的$n \le 10$在$\RR^2$和$\RR^3$,减少现有的差距,和紧密的界限高达$n=7$在$\RR^3$。
英文摘要:
The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture embeddability by polynomial systems with suitable structure, so that their mixed volume, which bounds the number of common roots, to yield interesting upper bounds on the number of embeddings. We focus on $\RR^2$ and $\RR^3$, where Laman graphs and 1-skeleta of convex simplicial polyhedra, respectively, admit inductive Henneberg constructions. We establish the first lower bound in $\RR^3$ of about $2.52^n$, where $n$ denotes the number of vertices. Moreover, our implementation yields upper bounds for $n \le 10$ in $\RR^2$ and $\RR^3$, which reduce the existing gaps, and tight bounds up to $n=7$ in $\RR^3$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。