arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.06911cs.DMmath.CO
收藏

实正交Holant定理的逆定理

The Converse of the Real Orthogonal Holant Theorem

University of Wisconsin-Madison(威斯康星大学麦迪逊分校)

Ben Young

AI总结:

本文证明了实正交Holant定理的逆定理,指出两组Holant不可区分的实值签名在正交变换下等价,解决了Xia(2010)的猜想并得出图同构判定等多个重要推论。

摘要:

Holant定理是研究Holant框架中计数问题计算复杂度的强大工具。由于Holant框架具有极强的表达能力,Holant定理的逆定理本身将是一个极其强大的计数不可区分性定理。最一般的逆定理并不成立,但我们证明了以下仍然具有高度一般性的版本:如果任意两组实值签名是Holant不可区分的,那么它们在正交变换下是等价的。这解决了Xia(2010年)的一个部分开放的猜想。该定理的推论包括:来自所有图的同态计数决定图同构的著名结果、实矩阵集合同时正交相似的经典充分条件,以及对称张量同时正交可分解(odeco)集合的组合刻画。

英文摘要:

The Holant theorem is a powerful tool for studying the computational complexity of counting problems. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very powerful counting indistinguishability theorem. The most general converse does not hold, but we prove the following, still highly general, version: if any two sets of real-valued signatures are Holant-indistinguishable, then they are equivalent up to an orthogonal transformation. This resolves a partially open conjecture of Xia (2010). Consequences of this theorem include the well-known result that homomorphism counts from all graphs determine a graph up to isomorphism, the classical sufficient condition for simultaneous orthogonal similarity of sets of real matrices, and a combinatorial characterization of simultaneously orthogonally decomposable (odeco) sets of symmetric tensors.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑