• Title of article

    An upper bound for permanents of nonnegative matrices

  • Author/Authors

    Samorodnitsky، Gennady نويسنده , , Alex، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2008
  • Pages
    14
  • From page
    279
  • To page
    292
  • Abstract
    A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l p is attained either for the identity matrix I or for a constant multiple of the all-1 matrix J. njecture is known to be true for p = 1 (I) and for p ⩾ 2 (J). ve the conjecture for a subinterval of ( 1 , 2 ) , and show the conjectured upper bound to be true within a subexponential factor (in the dimension) for all 1 < p < 2 . In fact, for p bounded away from 1, the conjectured upper bound is true within a constant factor.
  • Keywords
    Bounds and approximation algorithms for the permanent
  • Journal title
    Journal of Combinatorial Theory Series A
  • Serial Year
    2008
  • Journal title
    Journal of Combinatorial Theory Series A
  • Record number

    1531271