Title of article :
A lower bound on the maximum permanent in Λnk
Author/Authors :
Ian M. Wanless، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Pages :
15
From page :
153
To page :
167
Abstract :
Let Pnk be the maximum value achieved by the permanent over Λnk, the set of (0,1)-matrices of order n with exactly k ones in each row and column. Brègman proved that Pnk k!n/k. It is shown here that Pnk k!tr! where n=tk+r and 0 r
Keywords :
1) matrix , Bregman bound , Latin rectangle , Regular bipartite graph , Permanent , Merriell’s conjecture , (0
Journal title :
Linear Algebra and its Applications
Serial Year :
2003
Journal title :
Linear Algebra and its Applications
Record number :
824079
Link To Document :
