skip to main content
10.1145/1132516.1132578acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications

Published: 21 May 2006 Publication History

Abstract

Let p(x1,...,xn) = p(X), X ∈ Rn be a homogeneous polynomial of degree n in n real variables, e = (1,1,.,1) ∈ Rn be a vector of all ones . Such a polynomial p is called e-hyperbolic if for all real vectors X ∈ Rn the univariate polynomial equation p(te - X) = 0 has all real roots λ1(X) ≥ ... ≥ λn(X). The number of nonzero roots |i :λi(X) ≠ 0 | is called Rankp(X). An e-hyperbolic polynomial p is called POS-hyperbolic if roots of vectors X ∈ Rn+ with nonnegative coordinates are also nonnegative (the orthant Rn+ belongs to the hyperbolic cone) and p(e) > 0. Below e1,...,en stands for the canonical orthogonal basis in Rn. The main results of this paper states that if p(x1,x2,...,xn) is a POS-hyperbolic (homogeneous) polynomial of degree n, Rankp (ei) = Ri and p(x1,x2,...,xn) ≥ ∏1 ≤ i ≤ n xi ; xi > 0, 1 ≤ i ≤ n, then the following inequality holds ∂n/∂ x1...∂ xn p(0,...,0) ≥ ∏1 ≤ i ≤ n (Gi-1/Gi)Gi-1, where Gi = min(Ri, n+1-i) . 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 POS-hyperbolic polynomials which are products of linear forms with nonnegative coefficients.Our proof is relatively simple and "noncomputational"; it actually slightly improves Schrijver's lower bound, and uses very basic (more or less centered around Rolle's theorem) properties of hyperbolic polynomials. We present some important algorithmic applications of the result, including a polynomial time deterministic algorithm approximating the permanent of n x n entry-wise non-negative matrices within a multiplicative factor en/nm for any fixed positive m; and a deterministic poly-time algorithm approximating the permanent of n x n matrix A having at most k nonzero entries in each column to within a multiplicative factor (k-1/k)(k-1)n.This paper introduces a new powerful "polynomial" technique, which allows us to simplify and unify hard and key known results as well as to prove new important theorems and get new algorithms.

References

[1]
H. Aslaksen, Quaternionic Determinants, The Math. Intel. 18, No. 3, 57--65
[2]
A. Aleksandrov, On the theory of mixed volumes of convex bodies, IV, Mixed discriminants and mixed volumes (in Russian), Mat. Sb. (N.S.) 3 (1938), 227--251.
[3]
R. B. Bapat, Mixed discriminants of positive semidefinite matrices, Linear Algebra and its Applications 126, 107--124, 1989.
[4]
A. I. Barvinok, Two algorithmic results for the Traveling Salesman Problem, Math. Oper. Res. 21 (1996), 65--84 (2001 version from researchindex.com).
[5]
A. I. Barvinok, Computing Mixed Discriminants, Mixed Volumes, and Permanents, Discrete & Computational Geometry, 18 (1997), 205--237.
[6]
A. I. Barvinok, Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor, Random Structures & Algorithms, 14 (1999), 29--61.
[7]
H.H. Bauschke, O. Guler, A.S. Lewis and H.S. Sendov, Hyperbolic polynomials and Convex analysis, Canad. J. Math. Vol 53, 2001, 470--488.
[8]
Y.-B. Choe, J.G. Oxley, A. D. Sokal and D.G. Wagner, Homogeneous mltivariate polynomials with the half plane property, Advances in Applied Mathematics 32 (2004), 88--187 .
[9]
G.P. Egorychev, The solution of van der Waerden's problem for permanents, Advances in Math., 42, 299--305, 1981.
[10]
D. I. Falikman, Proof of the van der Waerden's conjecture on the permanent of a doubly stochastic matrix, Mat. Zametki 29, 6: 931--938, 957, 1981, (in Russian).
[11]
L.Garding, An inequality for hyperbolic polynomials, Jour. of Math. and Mech., 8(6): 957--965, 1959.
[12]
M. Grötschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
[13]
O. Guler, Hyperbolic polynomials and interior point methods for convex programming, Math. Oper. Res. (2) 22(1997), 350--377.
[14]
L. Gurvits. Combinatorics hidden in hyperbolic polynomials and related topics, preprint (2004), available at http://xxx.lanl.gov/abs/math.CO/0402088 .
[15]
L. Gurvits, Combinatorial and algorithmic aspects of hyperbolic polynomials, 2004; available at http://xxx.lanl.gov/abs/math.CO/0404474.
[16]
L. Gurvits and A. Samorodnitsky, A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume, Proc. 32 ACM Symp. on Theory of Computing, ACM, New York, 2000.
[17]
L. Gurvits and A. Samorodnitsky, A deterministic algorithm approximating the mixed discriminant and mixed volume, and a combinatorial corollary, Discrete Comput. Geom. 27: 531--550, 2002.
[18]
L. Gurvits and P. Yianilos, The deflation-inflation method for certain semidefinite programming and maximum determinant completion problems, NECI technical report, 1998.
[19]
L. Gurvits, Van der Waerden Conjecture for Mixed Discriminants, Advances in Mathematics, 2005. (Available at the journal web page .)
[20]
L. Gurvits, Hyperbolic Polynomials Approach to Van der Waerden/Schrijver-Valiant like Conjectures: Sharper Bounds, Simpler Proofs and Algorithmic Applications, 2005 ; available at http://xxx.lanl.gov/abs/math.CO/0510452 .
[21]
L. Hormander, Analysis of Linear Partial Differential Operators, Springer-Verlag, New York, Berlin, 1983.
[22]
A.G. Khovanskii, Analogues of the Aleksandrov-Fenchel inequalities for hyperbolic forms, Soviet Math. Dokl. 29(1984), 710--713.
[23]
A.S. Lewis, P.A. Parrilo, M.V. Ramana, The Lax conjecture is true, 2003 preprint.
[24]
N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998.
[25]
B.D.McKay, I.M.Wanless, Maximising the permanent of (0,1)-matrices and the number of extensions of Latin rectangles, Electron. J. Combin. 5 (1998) : Research Paper 11, 20 pp. (electronic).
[26]
H.Minc, Permanents, Addison-Wesley, Reading, MA, 1978.
[27]
N. Linial, A. Samorodnitsky and A. Wigderson, A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Proc. 30 ACM Symp. on Theory of Computing, ACM, New York, 1998.
[28]
A. Nemirovski and U. Rothblum, On complexity of matrix scaling, Linear Algebra Appl. 302/303, 435--460, 1999.
[29]
Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
[30]
J. Renegar, Hyperbolic programs, and their derivative relaxations, 2004; to appear in Foundations of Computational Mathematics (FOCM); available at http://www.optimization-online.org .
[31]
R. Schneider, Convex bodies: The Brunn-Minkowski Theory, Encyclopedia of Mathematics and Its Applications, vol. 44, Cambridge University Press, New York, 1993.
[32]
A. Schrijver and W.G.Valiant, On lower bounds for permanents, Indagationes Mathematicae 42 (1980) 425--427
[33]
A. Schrijver, Counting 1-factors in regular bipartite graphs, Journal of Combinatorial Theory, Series B 72 (1998) 122--135.
[34]
M. Voorhoeve, A lower bound for the permanents of certain (0,1) matrices, Indagationes Mathematicae 41 (1979) 83--86.

Cited By

View all
  • (2025)Symmetric Hyperbolic PolynomialsJournal of Pure and Applied Algebra10.1016/j.jpaa.2025.107869(107869)Online publication date: Jan-2025
  • (2024)A (Slightly) Improved Approximation Algorithm for Metric TSPOperations Research10.1287/opre.2022.233872:6(2543-2594)Online publication date: Nov-2024
  • (2023)Linear slices of Hyperbolic polynomials and positivity of symmetric polynomial functionsJournal of Pure and Applied Algebra10.1016/j.jpaa.2023.107552(107552)Online publication date: Oct-2023
  • Show More Cited By

Index Terms

  1. Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
    May 2006
    786 pages
    ISBN:1595931341
    DOI:10.1145/1132516
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 21 May 2006

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. convex optimization
    2. graph
    3. hyperbolic polynomials
    4. permanent

    Qualifiers

    • Article

    Conference

    STOC06
    Sponsor:
    STOC06: Symposium on Theory of Computing
    May 21 - 23, 2006
    WA, Seattle, USA

    Acceptance Rates

    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)7
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 14 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)Symmetric Hyperbolic PolynomialsJournal of Pure and Applied Algebra10.1016/j.jpaa.2025.107869(107869)Online publication date: Jan-2025
    • (2024)A (Slightly) Improved Approximation Algorithm for Metric TSPOperations Research10.1287/opre.2022.233872:6(2543-2594)Online publication date: Nov-2024
    • (2023)Linear slices of Hyperbolic polynomials and positivity of symmetric polynomial functionsJournal of Pure and Applied Algebra10.1016/j.jpaa.2023.107552(107552)Online publication date: Oct-2023
    • (2023)Linear Matrix Inequalities and SpectrahedraGeometry of Linear Matrix Inequalities10.1007/978-3-031-26455-9_2(9-64)Online publication date: 13-Jan-2023
    • (2021)Log-concave polynomials, I: Entropy and a deterministic approximation algorithm for counting bases of matroidsDuke Mathematical Journal10.1215/00127094-2020-0091170:16Online publication date: 1-Nov-2021
    • (2021)Capacity lower bounds via productizationProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451105(847-858)Online publication date: 15-Jun-2021
    • (2021)Counting matchings via capacity-preserving operatorsCombinatorics, Probability and Computing10.1017/S0963548321000122(1-26)Online publication date: 30-Apr-2021
    • (2019)Approximating the permanent by sampling from adaptive partitionsProceedings of the 33rd International Conference on Neural Information Processing Systems10.5555/3454287.3455082(8860-8871)Online publication date: 8-Dec-2019
    • (2019)Belief Propagation, Bethe Approximation and PolynomialsIEEE Transactions on Information Theory10.1109/TIT.2019.290185465:7(4353-4363)Online publication date: Jul-2019
    • (2019)Spectral Analysis of Matrix Scaling and Operator Scaling2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS.2019.00074(1184-1204)Online publication date: Nov-2019
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media