空间中直线相交图与圆序的复杂度
The Complexity of Intersection Graphs of Lines in Space and Circle Orders
AI总结:
本文证明空间中直线相交图和圆序的识别问题均为$\exists\mathbb{R}$-完全问题,从而在多项式时间内等价于实多项式系统可解性判定,并解决了Brightwell和Luczak的开放问题。
摘要:
我们考虑两类组合结构的识别问题的复杂度。若图$G=(V,E)$的每个顶点$v\in V$可映射到$\mathbb{R}^3$中的一条直线$\ell(v)$,使得$vw$是$E$中的边当且仅当$\ell(v)$与$\ell(w)$相交,则称$G$为空间中直线的相交图。若偏序集$(X,\prec)$的每个元素$x\in X$可映射到一个闭圆盘$C(x)$,使得$y\prec x$当且仅当$C(y)$包含于$C(x)$,则称$(X,\prec)$为圆序或2-时空序。我们证明直线相交图和圆序的识别问题均为$\exists\mathbb{R}$-完全问题,因此在多项式时间内等价于判定一个实多项式等式与不等式系统是否有解。第二个结果解决了Brightwell和Luczak提出的一个开放问题。
英文摘要:
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in $\mathbb{R}^3$ so that $vw$ is an edge in $E$ if and only if $\ell(v)$ and $\ell(w)$ intersect. A partially ordered set $(X,\prec)$ is said to be a circle order, or a 2-space-time order, if every $x\in X$ can be mapped to a closed circular disk $C(x)$ so that $y\prec x$ if and only if $C(y)$ is contained in $C(x)$. We prove that the recognition problems for intersection graphs of lines and circle orders are both $\exists\mathbb{R}$-complete, hence polynomial-time equivalent to deciding whether a system of polynomial equalities and inequalities has a solution over the reals. The second result addresses an open problem posed by Brightwell and Luczak.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。