Multidimensional permanents of polystochastic matrices

preprint2020arXivOpen access

Abstract

A dd-dimensional matrix is called \emph{11-polystochastic} if it is non-negative and the sum over each line equals~11. Such a matrix that has a single 11 in each line and zeros elsewhere is called a \emph{11-permutation} matrix. A \emph{diagonal} of a dd-dimensional matrix of order nn is a choice of nn elements, no two in the same hyperplane. The \emph{permanent} of a dd-dimensional matrix is the sum over the diagonals of the product of the elements within the diagonal. For a given order nn and dimension dd, the set of 11-polystochastic matrices forms a convex polytope that includes the 11-permutation matrices within its set of vertices. For even nn and odd dd, we give a construction for a class of 11-permutation matrices with zero permanent. Consequently, we show that the set of 11-polystochastic matrices with zero permanent contains at least nn3/2(1/2−o(1))n^{n^{3/2}(1/2-o(1))} 11-permutation matrices and contains a polytope of dimension at least cn3/2cn^{3/2} for fixed c,dc,d and even n→∞n\to\infty. We also provide counterexamples to a conjecture by Taranenko about the location of local extrema of the permanent. For odd dd, we give a construction of 11-permutation matrices that decompose into a convex linear sum of positive diagonals. These combine with a theorem of Taranenko to provide counterexamples to a conjecture by Dow and Gibson generalising van der Waerden's conjecture to higher dimensions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.