Related papers: Fourier Sparsity of GF(2) Polynomials

Let K be F_q((T)), or more generally any field of characteristic p equipped with a valuation having a finite residue field of q elements. Then a polynomial f(x) in K[x] having k+1 nonzero coefficients has at most q^k distinct zeros in K. We…

The present paper is devoted to investigating the two-dimensional real Jacobian conjecture. This conjecture claims that if $F=\left(f,g\right):\mathbb{R}^2\rightarrow \mathbb{R}^2$ is a polynomial map with $\det DF\left(x,y\right)\ne0$ for…

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…

We formulate a conjecture concerning spectral factorization of a class of trigonometric polynomials of two variables and prove it for special cases. Our method uses relations between the distribution of values of a polynomial of two…

Many questions in number theory concern the nonvanishing of determinants of square matrices of logarithms (complex or p-adic) of algebraic numbers. We present a new conjecture that states that if such a matrix has vanishing determinant,…

We consider the problem of finding a condition for a univariate polynomial having a given multiplicity structure when the number of distinct roots is given. It is well known that such conditions can be written as conjunctions of several…

We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Let f be a Boolean function with…

Koiran's real $\tau$-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…

We explore and illustrate the concept of ranked sparsity, a phenomenon that often occurs naturally in modeling applications when an expected disparity exists in the quality of information between different feature sets. Its presence can…

We exhibit, for each even degree, a ternary form of rank strictly greater than the maximum rank of monomials. Together with an earlier result in the odd case, this gives the lower bound…

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

$\newcommand{\sp}{\mathsf{sparsity}}\newcommand{\s}{\mathsf{s}}\newcommand{\al}{\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of…

Let $F$ be a field of prime characteristic $p$ and let $q$ be a power of $p$. We assume that $F$ contains the finite field of order $q$. A $q$-polynomial $L$ over $F$ is an element of the polynomial ring $F[x]$ with the property that those…

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

We prove bounds for the absolute sum of all level-$k$ Fourier coefficients for $(-1)^{p(x)}$, where polynomial $p:\mathbf{F}_2^n \to \mathbf{F}_2$ is of degree $1$ or degree $2$.

Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…

Let $f$ be a polynomial $f$ of degree $d\ge 2$ with integer coefficients which is irreducible over the rationals. Cilleruelo conjectured that the least common multiple of the values of the polynomial at the first $N$ integers satisfies…

Low-rank tensor approximations have shown great potential for uncertainty quantification in high dimensions, for example, to build surrogate models that can be used to speed up large-scale inference problems (Eigel et al., Inverse Problems…

We prove a function field analogue of a conjecture of Schinzel on the factorization of univariate polynomials over the rationals. We derive from it a finiteness theorem for the irreducible factorizations of the bivariate Laurent polynomials…