Counting matchings via capacity-preserving operators
From MaRDI portal
Publication:5886121
DOI10.1017/S0963548321000122MaRDI QIDQ5886121
Leonid Gurvits, Jonathan Leake
Publication date: 30 March 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.04351
Enumeration in graph theory (05C30) Combinatorial inequalities (05A20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Real polynomials: location of zeros (26C10) Inequalities involving derivatives and differential and integral operators (26D10)
Related Items
Lower bounds for contingency tables via Lorentzian polynomials, A short survey on stable polynomials, orientations and matchings
Cites Work
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- Mixed discriminants of positive semidefinite matrices
- Jensen polynomials and the Turán and Laguerre inequalities
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- On the number of matchings in regular graphs
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Proof of the van der Waerden conjecture for permanents
- Counting 1-factors in regular bipartite graphs
- Homogeneous multivariate polynomials with the half-plane property
- Hodge theory for combinatorial geometries
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- A representation theoretic explanation of the Borcea-Brändén characterization
- Correlation bounds for fields and matroids
- Finite free convolutions of polynomials
- Operator scaling: theory and applications
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Hyperbolic programs, and their derivative relaxations
- Polynomials with the half-plane property and matroid theory
- Theory of monomer-dimer systems
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
- Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
- On multivariate Newton-like inequalities
- Real stable polynomials and matroids: optimization and counting
- A generalization of permanent inequalities and applications in counting and optimization
- Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
