arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2606.26653cs.CC
收藏

测试与哈密顿环多项式的等价性

Testing Equivalence to the Hamiltonian Cycle Polynomial

Indian Institute of Science(印度科学学院)

Agrim Dewan

AI总结:

提出一种随机多项式时间算法,用于测试给定多项式是否与哈密顿环多项式HC_n在变量线性变换下等价,并分析了HC_n的对称性和自归约性质。

摘要:

哈密顿环多项式,记为$HC_n$,定义为$n$顶点完全有向图中加权哈密顿环的和,顶点标记为$1$到$n$,边由形式变量$x_{i,j}$加权。Valiant (STOC 1979) 研究了Permanent和$HC$,定义为族$\{HC_n | \ n \geq 1\}$,并证明了这两个族都是VNP完全的,前者在特征不为$2$的任何域上,后者在任何域上。自引入以来,$HC$已从下界(Jerrum-Snir, JACM 1982)、行列式复杂度(Huttenhain-Ikenmeyer, LAA 2016)以及其与Permanent的关系(Goulden-Jackson, EJC 1981; Grochow, ToC 2017)的角度进行了研究。其在任何域上的VNP完全性已被用于Malod (CCC 2007)、Grochow-Mulmuley-Qiao (ICALP 2016)和Hrubes (ToCT, 2016)的工作中。多项式$f(\mathbf{x})$的等价性测试问题(ET for $f$)如下:给定黑箱中的$g(\mathbf{x}) \in \mathbb{F}[\mathbf{x}]$,判断是否存在$A \in \mathrm{GL}_{|\mathbf{x}|}(\mathbb{F})$使得$g = f(A\mathbf{x})$。Kayal (STOC 2012)给出了Permanent的随机多项式时间ET算法。本文中,我们给出了$HC$的随机多项式时间ET算法,对域有温和的限制。我们证明,与Permanent多项式类似,在足够大的域上,$HC_n$的对称性由置换矩阵和缩放矩阵生成。我们还证明,与Permanent多项式不同(Mulmuley-Sohoni, SIAM J. Computing, 2001),$HC_n$不由其对称性刻画。尽管如此,与Permanent多项式类似,$HC_n$是向下自归约的(Zhang-Bai, TCS 2011),这意味着$HC_n$可由电路恒等式刻画,并且存在有效算法测试给定电路$\mathrm{C}$是否计算$HC_n$。我们还得到了$HC_n$的翻转定理作为其电路恒等式的推论。

英文摘要:

The Hamiltonian Cycle polynomial, denoted as $HC_n$, is defined to be the sum of the weighted Hamiltonian Cycles in an $n$-vertex complete digraph, with vertices labeled $1$ to $n$ and edges weighted by formal variables $x_{i,j}$. Valiant (STOC 1979) studied the Permanent and $HC$, defined as the family $\{HC_n | \ n \geq 1\}$, and showed both families are VNP-complete, the former over any field of characteristic other than $2$, and the latter over any field. Since its introduction, $HC$ has been studied from the perspective of lower bounds by Jerrum-Snir (JACM 1982), determinantal complexity by Huttenhain-Ikenmeyer (LAA 2016), and its relation to the Permanent by Goulden-Jackson (EJC 1981) and Grochow (ToC 2017). Its VNP-completeness over any field has been used in Malod (CCC 2007), Grochow-Mulmuley-Qiao (ICALP 2016) and Hrubes (ToCT, 2016). The Equivalence Testing problem for a polynomial $f(\mathbf{x})$ (ET for $f$) is as follows: Given $g(\mathbf{x}) \in \mathbb{F}[\mathbf{x}]$ as a black box, decide if there exists $A \in \mathrm{GL}_{|\mathbf{x}|}(\mathbb{F})$ such that $g = f(A\mathbf{x})$. Kayal (STOC 2012) gave a randomised polynomial time ET algorithm for the Permanent. In this work, we give a randomised polynomial time ET algorithm for $HC$ with mild constraints on the field. We show that, like the Permanent polynomial, the symmetries of $HC_n$ are generated by permutation and scaling matrices over large enough fields. We also show that $HC_n$ is not characterised by its symmetries, unlike the Permanent polynomial, Mulmuley-Sohoni (SIAM J. Computing, 2001). Nevertheless, like the Permanent polynomial, $HC_n$ is downward self-reducible, Zhang-Bai (TCS 2011), implying $HC_n$ is characterised by circuit identities and an efficient algorithm to test if a given circuit $\mathrm{C}$ computes $HC_n$. We also get a Flip theorem for $HC_n$ as a result of its circuit identities.

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

↑