Upper bounds on the permanent of multidimensional (0,1)-matrices
From MaRDI portal
Publication:892073
Abstract: The permanent of a multidimensional matrix is the sum of products of entries over all diagonals. By Minc's conjecture, there exists a reachable upper bound on the permanent of 2-dimensional (0,1)-matrices. In this paper we obtain some generalizations of Minc's conjecture to the multidimensional case. For this purpose we prove and compare several bounds on the permanent of multidimensional (0,1)-matrices. Most estimates can be used for matrices with nonnegative bounded entries.
Recommendations
Cited In (13)
- An upper bound on the number of high-dimensional permutations
- Extremes of permanents of \((0,1)\)-matrices.
- Values of the permanent function on multidimensional \((0,1) \)-matrices
- An upper bound for the permanent of \((0,1)\)-matrices.
- Upper bounds on the numbers of 1-factors and 1-factorizations of hypergraphs
- A range of the multidimensional permanent on (0, 1)-matrices
- An Upper Bound for the Permanent of a 3-Dimensional (0, 1)-Matrix
- New permanental bounds for Ferrers matrices
- Multidimensional permanents of polystochastic matrices
- On the numbers of 1-factors and 1-factorizations of hypergraphs
- Title not available (Why is no real title available?)
- Permanents of d-dimensional matrices
- Permanents of multidimensional matrices: properties and applications
This page was built for publication: Upper bounds on the permanent of multidimensional \((0,1)\)-matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892073)