一类(0,1)-矩阵的最大积和式

The Maximum Permanent of a Class of(0,1)-Matrices

中文关键词:  矩阵  积和式  直和

英文关键词:（0  1）-matrices  permanent  direct sum.

中文摘要:

      本文给出了每条线恰有n-2个1的n阶(0.1)-矩阵的最大积和式的组合表达式.

英文摘要:

      Let A_n,k denoted the set of (O,1)-matrices of order n with exactly k 1's in each lineand per(A)be the permanent of matrix A,and let β(n,k)=max{per(A)|A∈A_n,k}denotedthe largest permanent achieved by a matrix in A_n,k.In this paper,we gave a combinatorialexpression of β(n,n-2).