DeepAI AI Chat
Log In Sign Up

A Hyperbolic Extension of Kadison-Singer Type Results

by   Ruizhe Zhang, et al.

In 2013, Marcus, Spielman, and Srivastava resolved the famous Kadison-Singer conjecture. It states that for n independent random vectors v_1,⋯, v_n that have expected squared norm bounded by ϵ and are in the isotropic position in expectation, there is a positive probability that the determinant polynomial (xI - ∑_i=1^n v_iv_i^⊤) has roots bounded by (1 + √(ϵ))^2. An interpretation of the Kadison-Singer theorem is that we can always find a partition of the vectors v_1,⋯,v_n into two sets with a low discrepancy in terms of the spectral norm (in other words, rely on the determinant polynomial). In this paper, we provide two results for a broader class of polynomials, the hyperbolic polynomials. Furthermore, our results are in two generalized settings: ∙ The first one shows that the Kadison-Singer result requires a weaker assumption that the vectors have a bounded sum of hyperbolic norms. ∙ The second one relaxes the Kadison-Singer result's distribution assumption to the Strongly Rayleigh distribution. To the best of our knowledge, the previous results only support determinant polynomials [Anari and Oveis Gharan'14, Kyng, Luh and Song'20]. It is unclear whether they can be generalized to a broader class of polynomials. In addition, we also provide a sub-exponential time algorithm for constructing our results.


page 1

page 2

page 3

page 4


Hyperbolic Polynomials I : Concentration and Discrepancy

Chernoff bound is a fundamental tool in theoretical computer science. It...

Approximation and localized polynomial frame on double hyperbolic and conic domains

We study approximation and localized polynomial frames on a bounded doub...

Sampling discretization of integral norms of the hyperbolic cross polynomials

The paper is devoted to discretization of integral norms of functions fr...

Exponential lower bounds on spectrahedral representations of hyperbolicity cones

The Generalized Lax Conjecture asks whether every hyperbolicity cone is ...

Grothendieck inequalities characterize converses to the polynomial method

A surprising 'converse to the polynomial method' of Aaronson et al. (CCC...

An Algorithm for the Factorization of Split Quaternion Polynomials

We present an algorithm to compute all factorizations into linear factor...

Hypothesis testing with low-degree polynomials in the Morris class of exponential families

Analysis of low-degree polynomial algorithms is a powerful, newly-popula...