A generalization of permanent inequalities and applications in counting and optimization

DOI10.1016/j.aim.2021.107657zbMath1465.26015OpenAlexW3138195762MaRDI QIDQ2020379

Shayan Oveis Gharan, Nima Anari

Publication date: 23 April 2021

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aim.2021.107657

zbMATH Keywords

permanentperfect matchingdeterminantal point processesvan der Waerden's conjecturereal stable polynomials

Mathematics Subject Classification ID

Convex programming (90C25) Determinants, permanents, traces, other special matrix functions (15A15) Real polynomials: location of zeros (26C10) Approximation algorithms (68W25)

Related Items (1)

Lower bounds for contingency tables via Lorentzian polynomials

Cites Work

• Unnamed Item
• On general minimax theorems
• The membership problem in jump systems
• Counting 1-factors in regular bipartite graphs
• Polynomials with the half-plane property and matroid theory
• Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
• Determinantal Point Processes for Machine Learning
• Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
• Negative dependence and the geometry of polynomials
• Multivariate Pólya-Schur classification problems in the Weyl algebra
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• Counting matchings in irregular bipartite graphs and random lifts
• Nash Social Welfare, Matrix Permanent, and Stable Polynomials
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Maximizing determinants under partition constraints

This page was built for publication: A generalization of permanent inequalities and applications in counting and optimization