A stability result using the matrix norm to bound the permanent
- 8 Downloads
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose A is an n × n matrix over C (resp. R), and let P denote the set of n × n matrices over C (resp. R) that can be written as a permutation matrix times a unitary diagonal matrix. Then it is known that the permanent of A satisfies | per(A);| ≤;|;|A;|;|2 n with equality iff A/|;|A|;|2 ∈ P (where |;|A|;|2 is the operator 2-norm of A). We show a stability version of this result asserting that unless A is very close (in a particular sense) to one of these extremal matrices, its permanent is exponentially smaller (as a function of n) than |;|A|;|2 n . In particular, for any fixed α, β > 0, we show that |per(A)| is exponentially smaller than |;|A|;|2 n unless all but at most αn rows contain entries of modulus at least |;|A|;|2(1 − β).
Unable to display preview. Download preview PDF.
- A. Bonami, Étude des coefficients de Fourier des fonctions de Lp(G), Université de Grenoble. Annales de l’Institut Fourier 20 (1970), 335–402 (1971).Google Scholar
- L. Gurvits, On the complexity of mixed discriminants and related problems, in Mathematical Foundations of Computer Science 2005, Lecture Notes in Computer Science, Vol. 3618, Springer, Berlin, 2005, pp. 2005–447.Google Scholar
- L. Gurvits and A. Samorodnitsky, Bounds on the permanent and some applications, in 55th Annual IEEE Symposium on Foundations of Computer Science—FOCS 2014, IEEE, Los Alamitos, CA, 2014, pp. 2014–90.Google Scholar
- H. Nguyen, On matrices of large permanent, Private communication, 2016Google Scholar
- W. Schudy and M. Sviridenko, Concentration and moment inequalities for polynomials of independent random variables, in Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 2012, pp. 2012–437.Google Scholar