Related papers: A Near-Optimal Polynomial Distance Lemma Over Bool…

We present a variant of the Peskine--Szpiro Acyclicity Lemma, and hence a way to certify exactness of a complex of finite modules over a large class of (possibly) noncommutative rings. Specifically, over the class of Auslander regular…

We present the exact solution for a set of nonlinear algebraic equations $\frac{1}{z_l}= \pi d + \frac{2 d}{n} \sum_{m \neq l} \frac{1}{z_l-z_m}$. These were encountered by us in a recent study of the low energy spectrum of the Heisenberg…

We study the bias of random bounded-degree polynomials over odd prime fields and show that, with probability exponentially close to 1, such polynomials have exponentially small bias. This also yields an exponential tail bound on the weight…

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and…

We prove Dual Smale's mean value conjecture for all odd polynomials with nonzero linear term. Precisely, if $P$ is an odd polynomial of degree $d\ge3$ with $P(0)=0$ and $P'(0)=1$, then there exists a critical point $\zeta$ of $P$ such that…

When we consider the action of a finite group on a polynomial ring, a polynomial unchanged by the action is called an invariant polynomial. A famous result of Noether states that in characteristic zero the maximal degree of a minimal…

A special case of the Menshov--Rademacher theorem implies for almost all polynomials $x_1Z+\ldots +x_d Z^{d} \in {\mathbb R}[Z]$ of degree $d$ for the Weyl sums satisfy the upper bound $$ \left| \sum_{n=1}^{N}\exp\left(2\pi i \left(x_1…

The goal of this paper is to attract attention of the reader to a dimension-free geometric inequality that can be proved using the classical needle decomposition. This inequality allows us to derive sharp dimension-free estimates for the…

We consider algebraic ordinary differential equations (AODEs) and study their polynomial and rational solutions. A sufficient condition for an AODE to have a degree bound for its polynomial solutions is presented. An AODE satisfying this…

We prove best approximation error estimates for discontinuous piecewise polynomial approximation in fractional Sobolev spaces on non-Lipschitz meshes of non-Lipschitz domains. In particular, the boundary of the domain, and the boundaries of…

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

The goal of this paper is to develop a Heine-Stieltjes theory for univariate linear differential operators of higher order. Namely, for a given given operator T=\sum_i Q_i(z)d^i/dz^i with polynomial coefficients Q_i(z) set r=max_i (deg…

We consider the problem of finding a local optimum for Max-Cut with FLIP-neighborhood, in which exactly one node changes the partition. Schaeffer and Yannakakis (SICOMP, 1991) showed PLS-completeness of this problem on graphs with unbounded…

We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…

A classical theorem of Nisan and Szegedy says that a boolean function with degree $d$ as a real polynomial depends on at most $d2^{d-1}$ of its variables. In recent work by Chiarelli, Hatami and Saks, this upper bound was improved to $C…

Recent efforts in Analysis of Boolean Functions aim to extend core results to new spaces, including to the slice $\binom{[n]}{k}$, the hypergrid $[K]^n$, and noncommutative spaces (matrix algebras). We present here a new way to relate…

Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit $d^{O(1)}$-variate and degree $d$ polynomial $P_{d}\in VNP$ such that if any depth four circuit $C$ of bounded formal degree $d$ which computes a…

The study of iterations of functions over a finite field and the corresponding functional graphs is a growing area of research with connections to cryptography. The behaviour of such iterations is frequently approximated by what is know as…

Let $P_{<n}(z)$ be the Rudin-Shapiro polynomial of degree $n-1$. We show that $|P_{<n}(z)|\le \sqrt{6n-2}-1$ for all $n\ge0$ and $|z|=1$, confirming a longstanding conjecture. This bound is sharp in the case when $n=(2\cdot 4^k+1)/3$ and…

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $\Gamma_1,\ldots,\Gamma_j$ of low-degree…