activity
20042008
most citedConcentration of permanent estimators for certain large matrices

30 citations · 56 across the 10 of their papers we have counts for

collaborators

11 papers

math-ph20082 cited

Asymptotic Positivity of Hurwitz Product Traces: Two Proofs

Christian Fleischhack, Shmuel Friedland

Consider the polynomial in for positive hermitian matrices and with . The Bessis-Moussa-Villani conjecture (in the equivalent form of Lieb and…

math.CO2008

On the First Eigenvalue of Bipartite Graphs

Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled

In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bi…

math-ph20083 cited

Remarks on BMV conjecture

Shmuel Friedland

We show that for fixed , hermitian nonnegative definite matrices, and fixed the coefficients of the in the polynomial $\tr (A+tB)^m$ is positive if $\tr AB >0$ and $…

math.CO200812 cited

An upper bound for the number of perfect matchings in graphs

Shmuel Friedland

We give an upper bound on the number of perfect matchings in an undirected simple graph with an even number of vertices, in terms of the degrees of all the vertices in . Thi…

math.CO20081 cited

The maximum number of perfect matchings in graphs with a given degree sequence

Noga Alon, Shmuel Friedland

We show that the number of perfect matching in a simple graph with an even number of vertices and degree sequence is at most $\prod_{i=1}^n (d_i !)^{\frac{1…

math.CO20082 cited

On the Number of Matchings in Regular Graphs

S. Friedland, E. Krop, K. Markström

For the set of graphs with a given degree sequence, consisting of any number of and , and its subset of bipartite graphs, we characterize the optimal graphs who maximize…