arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.09389cs.CCmath.RAmath.RT
收藏

Hyperpeflancans与几何复杂性理论

Hyperpfaffians and Geometric Complexity Theory

Christian Ikenmeyer, Michael Walter

摘要:

超普夫兰多项式是由Barvinok在1995年引入的,作为著名的普夫兰多项式到高阶张量的自然推广。我们证明了在高阶张量空间上,超函数是唯一的最小度SL-不变量。然后研究了超函数的计算复杂性,证明了它是VNP-完全的。这就否定了Mulmuley在几何复杂性理论中关于不变环的计算复杂性的一个猜想。

英文摘要:

The hyperpfaffian polynomial was introduced by Barvinok in 1995 as a natural generalization of the well-known Pfaffian polynomial to higher order tensors. We prove that the hyperpfaffian is the unique smallest degree SL-invariant on the space of higher order tensors. We then study the hyperpfaffian's computational complexity and prove that it is VNP-complete. This disproves a conjecture of Mulmuley in geometric complexity theory about the computational complexity of invariant rings.

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

↑