关于有限特征中的不变量的一些事实
Some facts on Permanents in Finite Characteristics
摘要:
特征为3的k-半酉矩阵域上积和式的多项式时间可计算性(即方阵的Gram矩阵与相应的单位矩阵的差秩为k)的情形,以及对任意k > 1的3 P-完全性(参考文献9)是一个结果,它从本质上拓宽了我们对模3永久式的计算复杂性边界的理解。现在我们把这个结果推广到k > 1的情形,研究酉n × n-矩阵的(n-k)x(n-k)-子永久式(或永久子式)及其可能的关系,因为酉n × n-矩阵的(n-k)x(n-k)-子矩阵一般是k-半酉(n-k)x(n-k)-矩阵。下面的论文提供了一种方法来接收各种不同类型的这样的方程,同时将这一研究方向扩展到审查所有多项式时间永久保持约简集和它们可能产生的一般矩阵的子永久式的方程,包括一些概括和公式(在任意素数特征中有效)类似于与矩阵及其逆的子项相关的经典恒等式。此外,第二章还讨论了特征2中的Hamilton循环多项式,它令人惊讶地具有许多与特征3中的积和式的相应性质非常相似的性质,而在域GF(2)上它获得了更令人惊讶的性质。此外,第三章还研究了各种Cauchy矩阵的积和式及其相关函数的计算复杂性问题,并给出了它们的某些推广,包括在此基础上构造了特征为5的任意矩阵的积和式的多项式时间算法,并证明了特征为3的类似算法的存在性。
英文摘要:
The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in the case k = 0 or k = 1 and its #3P-completeness for any k > 1 (Ref. 9) is a result that essentially widens our understanding of the computational complexity boundaries for the permanent modulo 3. Now we extend this result to study more closely the case k > 1 regarding the (n-k)x(n-k)-sub-permanents (or permanent-minors) of a unitary nxn-matrix and their possible relations, because an (n-k)x(n-k)-submatrix of a unitary nxn-matrix is generically a k-semi-unitary (n-k)x(n-k)-matrix. The following paper offers a way to receive a variety of such equations of different sorts, in the meantime extending this direction of research to reviewing all the set of polynomial-time permanent-preserving reductions and equations for the sub-permanents of a generic matrix they might yield, including a number of generalizations and formulae (valid in an arbitrary prime characteristic) analogical to the classical identities relating the minors of a matrix and its inverse. Moreover, the second chapter also deals with the Hamiltonian cycle polynomial in characteristic 2 that surprisingly possesses quite a number of properties very similar to the corresponding ones of the permanent in characteristic 3, while over the field GF(2) it obtains even more amazing features. Besides, the third chapter is devoted to the computational complexity issues of the permanent and some related functions on a variety of Cauchy matrices and their certain generalizations, including constructing a polynomial-time algorithm (based on them) for the permanent of an arbitrary matrix in characteristic 5 (implying RP = NP) and conjecturing the existence of a similar scheme in characteristic 3.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。