Counting matchings via capacity-preserving operators. (30th November 2021)

• Record Type: Journal Article
• Authors: Gurvits, Leonid; Leake, Jonathan
• Is Part Of: Combinatorics, probability and computing. Volume 30:Number 6(2021)
• Page Start: 956
• Page End: 981
• Publication Date: 2021-11-30
• Subjects: 05A20 -- 05C70 -- 26C10 -- 26D10; Combinatorial analysis -- Periodicals; Probabilities -- Periodicals; Computer science -- Mathematics -- Periodicals; 511.6
• DOI: 10.1017/S0963548321000122
• Languages: English
• ISSNs: 0963-5483

Abstract

Abstract: The notion of the capacity of a polynomial was introduced by Gurvits around 2005, originally to give drastically simplified proofs of the van der Waerden lower bound for permanents of doubly stochastic matrices and Schrijver's inequality for perfect matchings of regular bipartite graphs. Since this seminal work, the notion of capacity has been utilised to bound various combinatorial quantities and to give polynomial-time algorithms to approximate such quantities (e.g. the number of bases of a matroid). These types of results are often proven by giving bounds on how much a particular differential operator can change the capacity of a given polynomial. In this paper, we unify the theory surrounding such capacity-preserving operators by giving tight capacity preservation bounds for all nondegenerate real stability preservers. We then use this theory to give a new proof of a recent result of Csikvári, which settled Friedland's lower matching conjecture.