Counting matchings via capacity-preserving operators

DOI10.1017/S0963548321000122MaRDI QIDQ5886121FDOQ5886121

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

zbMATH Keywords

capacity of a polynomialcapacity-preserving operators

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Inequalities involving derivatives and differential and integral operators (26D10) Combinatorial inequalities (05A20) Real polynomials: location of zeros (26C10)

Cites Work

• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
• Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
• Theory of monomer-dimer systems
• Homogeneous multivariate polynomials with the half-plane property
• The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
• The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
• Hyperbolic programs, and their derivative relaxations
• 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
• Hodge theory for combinatorial geometries
• Jensen polynomials and the Turán and Laguerre inequalities
• On the number of matchings in regular graphs
• Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
• Polynomials with the half-plane property and matroid theory
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• Mixed discriminants of positive semidefinite matrices
• A representation theoretic explanation of the Borcea-Brändén characterization
• Lower Bounds for Partial Matchings in Regular Bipartite Graphs and Applications to the Monomer–Dimer Entropy
• A generalization of permanent inequalities and applications in counting and optimization
• Real stable polynomials and matroids: optimization and counting
• On multivariate Newton-like inequalities
• Operator scaling: theory and applications
• Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
• Correlation bounds for fields and matroids
• Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory
• Finite free convolutions of polynomials

Cited In (2)

• A short survey on stable polynomials, orientations and matchings
• Lower bounds for contingency tables via Lorentzian polynomials

   Recommendations

• A short survey on stable polynomials, orientations and matchings 👍 👎
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems 👍 👎
• Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all 👍 👎
• A generalization of permanent inequalities and applications in counting and optimization 👍 👎
• A generalization of permanent inequalities and applications in counting and optimization 👍 👎

This page was built for publication: Counting matchings via capacity-preserving operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886121)