Related papers: The Gotsman-Linial Conjecture is False

In this paper we prove the Gromov--Milman conjecture (the Dvoretzky type theorem) for homogeneous polynomials on $\mathbb R^n$, and improve bounds on the number $n(d,k)$ in the analogous conjecture for odd degrees $d$ (this case is known as…

We investigate 4-dim gauge theories and gravitational theories with nonpolynomial actions containing an infinite series in covariant derivatives of the fields representing the expansion of a transcendental entire function. A class of entire…

Random hyperspherical harmonics are Gaussian Laplace eigenfunctions on the unit $d$-dimensional sphere ($d\ge 2$). We study the convergence in Total Variation distance for their nonlinear statistics in the high energy limit, i.e., for…

Motzkin and Straus established a close connection between the maximum clique problem and a solution (namely graph-Lagrangians) to the maximum value of a class of homogeneous quadratic multilinear functions over the standard simplex of the…

For $1\le d\le \ell< k$, we give a new lower bound for the minimum $d$-degree threshold that guarantees a Hamilton $\ell$-cycle in $k$-uniform hypergraphs. When $k\ge 4$ and $d< \ell=k-1$, this bound is larger than the conjectured minimum…

Rue and Held (2005) proposed a method for efficiently computing the Gaussian likelihood for stationary Markov random field models, when the data locations fall on a complete regular grid, and the model has no additive error term. The…

Let $X$ be a smooth projective variety defined on a finite field $\mathbb{F}_q$. On $X$ there is a special morphism $Fr_X$, which raises coordinates to exponent $q$: $t\mapsto t^q$. The two main results in this paper are: Result 1: If…

A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…

We consider the problem of testing if a given function f : F_2^n -> F_2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem. The Gowers norm is based on a natural 2^{d+1}-query test for this…

Let $G$ be a simple graph with maximum degree denoted as $\Delta(G)$. An overfull subgraph $H$ of $G$ is a subgraph satisfying the condition $|E(H)| > \Delta(G)\lfloor \frac{1}{2}|V(H)| \rfloor$. In 1986, Chetwynd and Hilton proposed the…

Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph on $n$ vertices is uniquely maximised by…

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

In the concluding remarks of their 1993 published and now famous paper, Jeff Kahn and Gil Kalai wrote in particular: "Our construction shows that Borsuk's conjecture is false for d = 1,325 and for every d > 2,014." But, as Bernulf Weiszbach…

A $d$-dimensional polycube is a facet-connected set of cells (cubes) on the $d$-dimensional cubical lattice $\mathbb{Z}^d$. Let $A_d(n)$ denote the number of $d$-dimensional polycubes (distinct up to translations) with $n$ cubes, and…

For $G$ an open set in $\mathbb{C}$ and $W$ a non-vanishing holomorphic function in $G$, in the late 1990's, Pritsker and Varga characterized pairs $(G,W)$ having the property that any $f$ holomorphic in $G$ can be locally uniformly…

In 1927 P\'olya proved that the Riemann Hypothesis is equivalent to the hyperbolicity of Jensen polynomials for the Riemann zeta function $\zeta(s)$ at its point of symmetry. This hyperbolicity has been proved for degrees $d\leq 3$. We…

Let $G$ be a graph of order $n$ and $P(G,x)$ be the chromatic polynomial of $G$. Dong, Ge, Gong, Ning, Ouyang, and Tay (J. Graph Theory 96(2021) 343) conjectured that $\frac{d^k}{dx^k} \bigl( \ln[(-1)^n P(G, x)] \bigr) < 0$ holds for all $k…

For any $m\geq 3$ we show that the Hamming graph $H(n,m)$ admits an imbalanced partition into $m$ sets, each inducing a subgraph of low maximum degree. This improves previous results by Tandya and by Potechin and Tsang, and disproves the…

Let $\lambda(n)$ be the Liouville function. We study the distribution of \[ \frac{1}{x^{1/2}}\sum_{x\leq n\leq 2x}\lambda(f(n)) \] over random polynomials $f$ of fixed degree $d$ and coefficients bounded in magnitude by $H$. In particular…

Let $X\subset\mathbb P^4$ be a very general hypersurface of degree $d\ge6$. Griffiths and Harris conjectured in 1985 that the degree of every curve $C\subset X$ is divisible by $d$. Despite substantial progress by Koll\'ar in 1991, this…