Related papers: The Gotsman-Linial Conjecture is False

A recent conjecture by I. Ra\c{s}a asserts that the sum of the squared Bernstein basis polynomials is a convex function in $[0,1]$. This conjecture turns out to be equivalent to a certain upper pointwise estimate of the ratio…

In 1971 Griffiths used a generating function to define polynomials in d variables orthogonal with respect to the multinomial distribution. The polynomials possess a duality between the discrete variables and the degree indices. In 2004…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

We give a short proof of an inequality, conjectured by Tsfasman and proved by Serre, for the maximum number of points on hypersurfaces over finite fields. Further, we consider a conjectural extension, due to Tsfasman and Boguslavsky, of…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

In 1904, Dickson [5] stated a very important conjecture. Now people call it Dickson's conjecture. In 1958, Schinzel and Sierpinski [14] generalized Dickson's conjecture to the higher order integral polynomial case. However, they did not…

Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in…

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

Tsfasman-Boguslavsky Conjecture predicts the maximum number of zeros that a system of linearly independent homogeneous polynomials of the same positive degree with coefficients in a finite field can have in the corresponding projective…

In 2004, Kim and Vu conjectured that, when $d=\omega(\log n)$, the random $d$-regular graph $G_d(n)$ can be sandwiched with high probability between two random binomial graphs $G(n,p)$ with edge probabilities asymptotically equal to…

In 2016 Ananyan and Hochster proved Stillman's conjecture by showing the existence of a uniform upper bound on the length of an $R_\eta$-sequence containing fixed $n$ forms of degree at most $d$ in polynomial rings over a field. This result…

We consider the symmetric binary perceptron model, a simple model of neural networks that has gathered significant attention in the statistical physics, information theory and probability theory communities, with recent connections made to…

The Hahn-Banach theorem states that onto each line in every normed space, there is a unitary projection, and Kadec and Snobar proved (using John's ellipsoid) that onto each $n$-dimensional subspace of any real normed space, there is a…

In earlier work, we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an oracle separating the decision versions would follow from what we called the Generalized Linial-Nisan (GLN)…

We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…

Let $p$ be a fixed prime number, and $N$ be a large integer. The 'Inverse Conjecture for the Gowers norm' states that if the "$d$-th Gowers norm" of a function $f:\F_p^N \to \F_p$ is non-negligible, that is larger than a constant…

In 1993 one of the authors formulated some conjectures on monotonicity of ratios for exponential series sections. They lead to more general conjecture on monotonicity of ratios of Kummer hypergeometric functions and was not proved from…

Let $G$ be a simple graph with order $n$, maximum degree $\D(G)$, minimum degree $\delta(G)$ and chromatic index $\chi'(G)$, respectively. A graph $G$ is called {\em $\D$-critical} if $\chi'(G)=\D(G)+1$ and $\chi'(H)\textless \chi'(G)$ for…

We study the Gaussian statistical models whose log-likelihood function has a unique complex critical point, i.e., has maximum likelihood degree one. We exploit the connection developed by Am\'endola et. al. between the models having maximum…

The celebrated Ore-DeMillo-Lipton-Schwartz-Zippel (ODLSZ) lemma asserts that n-variate non-zero polynomial functions of degree d over a field $\mathbb{F}$ are non-zero over any "grid" $S^n$ for finite subset $S \subseteq \mathbb{F}$, with…