20 citations · 138 across the 47 of their papers we have counts for
Showing 2018Show all
4 papers · 1 filter
math.CO2018
Searching for dense subsets in a graph via the partition function
Alexander Barvinok, Anthony Della Pella
For a set of vertices of a graph , we define its density as the ratio of the number of edges of spanned by the vertices of to .…
math.CO2018★ 3 cited
Approximating real-rooted and stable polynomials, with combinatorial applications
Alexander Barvinok
Let be a polynomial with all roots real and satisfying for some . We show that for any , the value of is de…
cs.DS2018
Stability and complexity of mixed discriminants
Alexander Barvinok
We show that the mixed discriminant of positive semidefinite real symmetric matrices can be approximated within a relative error in quasi-polynomial $n^{O(\l…
math.CO2018
Computing permanents of complex diagonally dominant matrices and tensors
Alexander Barvinok
We prove that for any , fixed in advance, the permanent of an complex matrix, where the absolute value of each diagonal entry is at least times bigger than t…