基于投影矩阵的Lovász-Theta数的一个变体
A variant of the Lovász-Theta number based on projection matrices
摘要:
我们引入了一个新的模型的色数$χ(G)$的基础上,我们称之为组合投影矩阵,这是一类特殊的双随机对称投影矩阵。放松这个模型会产生一个SDP,其最优值是投影θ数$\hat{\vartheta}(G)$,它与Szegedy数$\vartheta^+(G)$密切相关,是Lovász θ数的一个变体。我们的特点是,在一般情况下,$\hat{\vartheta}(G)\leq \vartheta^+(G)$,与平等,如果$G$是顶点传递。虽然这似乎意味着在这种情况下,使用二进制矩阵比使用二进制特征值更好,但我们的方法比计算顶点传递图上的Szegedy数略快。
英文摘要:
We introduce a new model for the chromatic number $χ(G)$ based on what we call combinatorial projection matrices, which is a special class of doubly stochastic symmetric projection matrices. Relaxing this models yields an SDP whose optimal value is the projection theta number $\hat{\vartheta}(G)$, which is closely related to the Szegedy number $\vartheta^+(G)$, a variant of the Lovász theta number. We characterize that in general, $\hat{\vartheta}(G)\leq \vartheta^+(G)$, with equality if $G$ is vertex-transitive. While this seems to imply that working with binary matrices is a better paradigm than working with binary eigenvalues in this context, our approach is slightly faster than computing the Szegedy number on vertex-transitive graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。