Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
From MaRDI portal
Publication:1010786
zbMath1182.15008arXiv0711.3496MaRDI QIDQ1010786
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0711.3496
permanentsperfect matchingsdoubly stochastic matricesregular bipartite graphsvan der Waerden conjectureH-stable polynomialhomogemeous polynomialschrijver valiant conjecture
Exact enumeration problems, generating functions (05A15) Determinants, permanents, traces, other special matrix functions (15A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Counting matchings via capacity-preserving operators, Contractive determinantal representations of stable polynomials on a matrix polyball, Maximizing products of linear forms, and the permanent of positive semidefinite matrices, Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems, Paving property for real stable polynomials and strongly Rayleigh processes, Proof of the Monotone Column Permanent Conjecture, Factorially many maximum matchings close to the Erdős-Gallai bound, Central swaths, On the proportion of transverse-free plane curves, Determinant majorization and the work of Guo-Phong-Tong and Abja-Olive, Stable multivariate Eulerian polynomials and generalized Stirling permutations, Permanents of multidimensional matrices: Properties and applications, Interactions of computational complexity theory and mathematics, Concentration of the mixed discriminant of well-conditioned matrices, Lower bounds for contingency tables via Lorentzian polynomials, Solutions to two problems on permanents, Statistical Matching Theory, An upper bound on the number of high-dimensional permutations, Matchings in vertex-transitive bipartite graphs, Relative entropy optimization and its applications, On the numbers of 1-factors and 1-factorizations of hypergraphs, Imaginary projections of polynomials, On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries, Stable Noncommutative Polynomials and Their Determinantal Representations, Stable and real-zero polynomials in two variables, Random dense bipartite graphs and directed graphs with specified degrees, An approximation algorithm for counting contingency tables, Matchings in Benjamini–Schramm convergent graph sequences, Multivariate stable polynomials: theory and applications, Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications, Smooth hyperbolicity cones are spectrahedral shadows, Roots of Gårding hyperbolic polynomials, Conic stability of polynomials, Gårding's Theory of Hyperbolic Polynomials, Introduction to the combinatorial atlas, The minimum number of spanning trees in regular multigraphs, Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem, On the algebraic and topological structure of the set of Turán densities, A short survey on stable polynomials, orientations and matchings, The Halász–Székely barycenter
