Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all (Q1010786): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
 
Property / arXiv ID
 
Property / arXiv ID: 0711.3496 / rank
 
Normal rank

Latest revision as of 19:33, 18 April 2024

scientific article
Language Label Description Also known as
English
Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
scientific article

    Statements

    Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all (English)
    0 references
    0 references
    7 April 2009
    0 references
    Summary: Let \(p\) be a homogeneous polynomial of degree \(n\) in \(n\) variables, \(p(z_1,...,z_n) = p(Z) , Z \in C^{n}\). We call a such polynomial \(p\) H-stable if \(p(z_1,...,z_n) \neq 0\) provided the real parts \(Re(z_i) > 0, 1 \leq i \leq n\). This notion from control theory is closely related to the notion of hyperbolicity used intensively in the PDE theory. The main theorem in this paper states that if \(p(x_1,\dots,x_n)\) is a homogeneous H-stable polynomial of degree \(n\) with nonnegative coefficients; \(deg_{p}(i)\) is the maximum degree of the variable \(x_i, C_i = \min(deg_{p}(i),i)\) and \(Cap(p) = \inf_{x_i > 0, 1 \leq i \leq n}\frac {p(x_1,...,x_n)}{x_1 \dots x_n}\) then the following inequality holds \[ \frac{\partial^n}{\partial x_1...\partial x_n} p(0,\dots,0) \geq Cap(p) \Pi_{2 \leq i \leq n} \left(\frac{C_i-1}{C_i}\right)^{C_{i}-1}. \] This inequality is a vast (and unifying) generalization of the van der Waerden conjecture on the permanents of doubly stochastic matrices as well as the Schrijver-Valiant conjecture on the number of perfect matchings in \(k\)-regular bipartite graphs. These two famous results correspond to the H-stable polynomials which are products of linear forms. Our proof is relatively simple and ``noncomputational''; it uses just very basic properties of complex numbers and the AM/GM inequality.
    0 references
    0 references
    0 references
    0 references
    0 references
    homogemeous polynomial
    0 references
    H-stable polynomial
    0 references
    van der Waerden conjecture
    0 references
    permanents
    0 references
    doubly stochastic matrices
    0 references
    schrijver valiant conjecture
    0 references
    perfect matchings
    0 references
    regular bipartite graphs
    0 references
    0 references