On Leonid Gurvits’s Proof for Permanents

DOI10.4169/000298910X523380zbMath1210.15008OpenAlexW2166623251WikidataQ58181473 ScholiaQ58181473MaRDI QIDQ3069248

Monique Laurent, Alexander Schrijver

Publication date: 25 January 2011

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4169/000298910x523380

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Determinants, permanents, traces, other special matrix functions (15A15)

Related Items (10)

Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems ⋮ On the proportion of transverse-free plane curves ⋮ Permanents of multidimensional matrices: Properties and applications ⋮ Statistical Matching Theory ⋮ An upper bound on the number of high-dimensional permutations ⋮ Matchings in vertex-transitive bipartite graphs ⋮ Exponentially many perfect matchings in cubic graphs ⋮ Matchings in Benjamini–Schramm convergent graph sequences ⋮ Multivariate stable polynomials: theory and applications ⋮ A short survey on stable polynomials, orientations and matchings

This page was built for publication: On Leonid Gurvits’s Proof for Permanents