Counting Matchings via Capacity Preserving Operators

J. L. Walsh, On the location of the roots of certain types of polynomials , Transactions of the American Mathematical Society (1922), 163–180

1922

Earlier work this paper cites.

Ole J. Heilmann and Elliott H. Lieb, Theory of Monomer-Dimer Systems , Communications in Mathematical Physics (1972), 190–232

1972

Earlier work this paper cites.

G. P. Egorychev, Proof of the van der Waerden conjecture for permanents , Siberian Mathematical Journal 22

1981

Earlier work this paper cites.

Dmitry I. Falikman, Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix , Mathematical notes of the Academy of Sciences of the USSR 29

1981

Earlier work this paper cites.

R. B. Bapat, Mixed discriminants of positive semidefinite matrices , Linear Algebra and its Applications 126

1989

Earlier work this paper cites.

Thomas Craven and George Csordas, Jensen polynomials and the Turán and Laguerre inequalities , Pacific Journal of Mathematics 136

1989

Earlier work this paper cites.

Alexander Schrijver, Counting 1-factors in regular bipartite graphs , J. Comb. Theory, Ser. B 72

1998

Earlier work this paper cites.

Young-Bin Choe, James G. Oxley, Alan D. Sokal, and David G. Wagner, Homogeneous multivariate polynomials with the half-plane property , Advances in Applied Mathematics 32

2004

Earlier work this paper cites.

Leonid Gurvits, Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications , Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, ACM, 2006, pp. 417–426

2006

Earlier work this paper cites.

James Renegar, Hyperbolic programs, and their derivative relaxations , Foundations of Computational Mathematics 6

2006

Cited alongside, same era.

Petter Brändén, Polynomials with the half-plane property and matroid theory , Advances in Mathematics 216

2007

Cited alongside, same era.

Shmuel Friedland and Leonid Gurvits, Lower bounds for partial matchings in regular bipartite graphs and applications to the monomer–dimer entropy , Combinatorics, Probability and Computing 17

2008

Cited alongside, same era.

Shmuel Friedland, E. Krop, and Klas Markström, On the number of matchings in regular graphs , the electronic journal of combinatorics 15

2008

Cited alongside, same era.

Julius Borcea and Petter Brändén, The Lee-Yang and Pólya-Schur programs I: Linear operators preserving stability , Inventiones mathematicae 177

2009

Cited alongside, same era.

Peter Bürgisser, Ankit Garg, Rafael Oliveira, Michael Walter, and Avi Wigderson, Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory , arXiv preprint arXiv:1711.08039 (2017)

Original

2017

Later among the works it cites.

Jonathan Leake, A representation theoretic explanation of the Borcea-Brändén characterization , arXiv preprint arXiv:1706.06168 (2017)

Original

2017

Later among the works it cites.

Damian Straszak and Nisheeth K. Vishnoi, Real stable polynomials and matroids: Optimization and counting , Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, ACM, 2017, pp. 370–383

2017

Later among the works it cites.

Samuel Zackrisson, Coefficients and zeros of mixed characteristic polynomials , 2017

2017

Later among the works it cites.

Nima Anari, Shayan Oveis Gharan, and Cynthia Vinzant, Log-concave polynomials, entropy, and a deterministic approximation algorithm for counting bases of matroids , arXiv preprint arXiv:1807.00929 (2018)