Counting matchings via capacity-preserving operators

DOI10.1017/S0963548321000122MaRDI QIDQ5886121zbMATH OpenFDO

Authors Leonid Gurvits, Jonathan Leake

Publication date 30 March 2023

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1804.04351

zbMATH Keywords

capacity of a polynomialcapacity-preserving operators

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Enumeration in graph theory (05C30) 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)

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

Cites work

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

Cited in

(4)

• A short survey on stable polynomials, orientations and matchings
• Lower bounds for contingency tables via Lorentzian polynomials
• Counting Matchings via Capacity Preserving Operators
• Capacity bounds on integral flows and the Kostant partition function

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)