The real tau-conjecture is true on average

06/01/2018
by   Irénée Briquel, et al.
0

Koiran's real τ-conjecture claims that the number of real zeros of a structured polynomial given as a sum of m products of k real sparse polynomials, each with at most t monomials, is bounded by a polynomial in m,k,t. This conjecture has a major consequence in complexity theory since it would lead to superpolynomial bounds for the arithmetic circuit size of the permanent. We confirm the conjecture in a probabilistic sense by proving that if the coefficients involved in the description of f are independent standard Gaussian random variables, then the expected number of real zeros of f is O(mkt), which is linear in the number of parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2019

A polynomial approach to the Collatz conjecture

The Collatz conjecture is explored using polynomials based on a binary n...
research
11/06/2019

How many zeros of a random sparse polynomial are real?

We investigate the number of real zeros of a univariate k-sparse polynom...
research
08/04/2021

The Gotsman-Linial Conjecture is False

In 1991, Craig Gotsman and Nathan Linial conjectured that for all n and ...
research
01/09/2022

Arithmetic Network Coding for Secret Sum Computation

We consider a network coding problem where the destination wants to reco...
research
03/24/2023

Roudneff's Conjecture in Dimension 4

J.-P. Roudneff conjectured in 1991 that every arrangement of n ≥ 2d+1≥ 5...
research
01/29/2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

Vizing's conjecture (open since 1968) relates the sizes of dominating se...
research
06/01/2023

Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition

One of the major open problems in complexity theory is proving super-log...

Please sign up or login with your details

Forgot password? Click here to reset