Related papers: Fourier Sparsity of GF(2) Polynomials

We overcome two major bottlenecks in the study of low rank approximation by assuming the low rank factors themselves are sparse. Specifically, (1) for low rank approximation with spectral norm error, we show how to improve the best known…

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

We give a high precision polynomial-time approximation scheme for the supremum of any honest n-variate (n+2)-nomial with a constant term, allowing real exponents as well as real coefficients. Our complexity bounds count field operations and…

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

We consider general Gaussian latent tree models in which the observed variables are not restricted to be leaves of the tree. Extending related recent work, we give a full semi-algebraic description of the set of covariance matrices of any…

We present a deterministic 2^O(t)q^{(t-2)(t-1)+o(1)} algorithm to decide whether a univariate polynomial f, with exactly t monomial terms and degree <q, has a root in F_q. A corollary of our method --- the first with complexity sub-linear…

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

Let F and K be fields of characteristic 0, with F a subset of K. Let K[x] denote the ring of polynomials with coefficients in K. For p in K[x]\F[x], deg(p) = n, let r be the highest power of x with a coefficient not in F. We define the F…

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

Let $F$ be a finite set of monomials of the same degree $d\geq 2$ in a polynomial ring $R=k[x_1,...,x_n]$ over an arbitrary field $k$. We give some necessary and/or sufficient conditions for the birationality of the ring extension…

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

For given integers $n$ and $d$, both at least 2, we consider a homogeneous multivariate polynomial $f_d$ of degree $d$ in variables indexed by the edges of the complete graph on $n$ vertices and coefficients depending on cardinalities of…

We propose a new approach to the Fourier restriction conjectures. It is based on a discretization of the Fourier extension operators in terms of quadratically modulated wave packets. Using this new point of view, and by combining natural…

In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to…

According to the real \tau-conjecture, the number of real roots of a sum of products of sparse polynomials should be polynomially bounded in the size of such an expression. It is known that this conjecture implies a superpolynomial lower…

We use a deterministic construction to prove the optimality of the exponent in the Mockenhaupt-Mitsis-Bak-Seeger Fourier restriction theorem for dimension $d=1$ and parameter range $0 < a,b \leq d$ and $b\leq 2a$. Previous constructions by…

We present a new semidefinite Farkas lemma involving a side constraint on the rank. This lemma is then used to present a new proof of a recent characterization, by Connelly and Gortler, of dimensional rigidity of bar frameworks.

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

We show that if $h\in \mathbb{Z}[x]$ is a polynomial of degree $k \geq 2$ such that $h(\mathbb{N})$ contains a multiple of $q$ for every $q\in \mathbb{N}$, known as an $\textit{intersective polynomial}$, then any subset of $\{1,2,\dots,N\}$…

We consider real polynomials in finitely many variables. Let the variables consist of finitely many blocks that are allowed to overlap in a certain way. Let the solution set of a finite system of polynomial inequalities be given where each…