Let P (m;n) denote the maximum permanent of an n-by-n lower Hessenberg (0;1)-matrix with m entries equal to 1. A "staircased" structure for some matrices achieving this maximum is obtained, and recursive formulas for computing P (m;n) are given. This structure and results about permanents are used to determine the exact values of P (m;n) for n <= m <= 8n/3 and for all nnz(H-n)-nnz(H-[n/2]) <= m <= nnz(Hn), where nnz(H-n)=(n(2)=3n-2)/2 is the maximum number of ones in an n-by-n Hessenberg (0;1)-matrix.
引用
收藏
页数:25
相关论文
共 5 条
[1]
Brualdi R. A., 1991, COMBINATORIAL MATRIX, V39