Computing permanents of complex diagonally dominant matrices and tensors

01/12/2018
by   Alexander Barvinok, et al.
0

We prove that for any λ > 1, fixed in advance, the permanent of an n × n complex matrix, where the absolute value of each diagonal entry is at least λ times bigger than the sum of the absolute values of all other entries in the same row, can be approximated within any relative error 0 < ϵ < 1 in quasi-polynomial n^O( n - ϵ) time. We extend this result to multidimensional permanents of tensors and discuss its application to weighted counting of perfect matchings in hypergraphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2020

The Largest Entry in the Inverse of a Vandermonde Matrix

We investigate the size of the largest entry (in absolute value) in the ...
research
06/13/2018

Stability and complexity of mixed discriminants

We show that the mixed discriminant of n positive semidefinite n × n rea...
research
04/21/2021

On the rank of Z_2-matrices with free entries on the diagonal

For an n × n matrix M with entries in ℤ_2 denote by R(M) the minimal ran...
research
10/12/2020

On lattice point counting in Δ-modular polyhedra

Let a polyhedron P be defined by one of the following ways: (i) P = {x...
research
05/22/2020

More on zeros and approximation of the Ising partition function

We consider the problem of computing ∑_x e^f(x), where f(x)=∑_ij a_ijξ_i...
research
12/09/2020

Counting Real Roots in Polynomial-Time for Systems Supported on Circuits

Suppose A={a_1,…,a_n+2}⊂ℤ^n has cardinality n+2, with all the coordinate...
research
04/29/2018

A QPTAS for Gapless MEC

We consider the problem Minimum Error Correction (MEC). A MEC instance i...

Please sign up or login with your details

Forgot password? Click here to reset