Related papers: Junta threshold for low degree Boolean functions o…

We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For k greater than or equal to 2, a bipartite digraph D with colour classes of cardinalities k is hamiltonian if the sum of degrees of vertices u and…

We establish a lower bound of $\Omega{(\sqrt{n})}$ on the bounded-error quantum query complexity of read-once Boolean functions, providing evidence for the conjecture that $\Omega(\sqrt{D(f)})$ is a lower bound for all Boolean functions.…

We prove a recent conjecture of Manolescu-Willis which states that the $s$-invariant of a knot in $\mathbb{RP}^3$ (as defined by them) gives a lower bound on its null-homologous slice genus in the unit disk bundle of $TS^2$. We also…

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…

This paper demonstrates that the space of piecewise smooth functions can be well approximated by the space of functions defined by a set of simple (non-linear) operations on smooth uniform splines. The examples include bivariate functions…

Let $U\subset \mathbb P^N$ be a projective variety which is not a cone and whose hyperplane sections are smooth Enriques surfaces. We prove that the degree of a $U$ is at most 32 and the bound is sharp.

For any positive integer $g$, we completely determine the minimal genus function for $\Sigma_{g}\times T^{2}$. We show that the lower bound given by the adjunction inequality is not sharp for some class in $H_{2}(\Sigma_{g}\times T^{2})$.…

We study lower bounds for dyadic square functions of indicator functions. In the case of the dyadic square function $S_{2}$ we obtain a sharp lower bound: for every measurable $A \subset {[0,1)}$, we have \[…

Holomorphic Cliffordian functions of order $k$ are functions in the kernel of the differential operator $\overline{\partial}\Delta^k$. When $\overline{\partial}\Delta^k$ is applied to functions defined on the paravector space of some…

The $\epsilon$-approximate degree $deg_\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\epsilon$. The approximate degree of $f$ is at least $k$ iff there…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

A $k$-geodetic digraph with minimum out-degree $d$ has excess $\epsilon $ if it has order $M(d,k) + \epsilon $, where $M(d,k)$ represents the Moore bound for out-degree $d$ and diameter $k$. For given $\epsilon $, it is simple to show that…

For polynomials, local connectivity of Julia sets is a much-studied and important property. Indeed, when the Julia set of a polynomial of degree $d\geq 2$ is locally connected, the topological dynamics can be completely described as a…

We show that for a suitable class of functions of finitely-many variables, the limit of integrals along slices of a high dimensional sphere is a Gaussian integral on a corresponding finite-codimension affine subspace in infinite dimensions.

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

We exhibit large values of the Dedekind zeta function of a cyclotomic field on the critical line. This implies a dichotomy whereby one either has improved lower bounds for the maximum of the Riemann zeta function, or large values of…

The Julia quotient measures the ratio of the distance of a function value from the boundary to the distance from the boundary. The Julia-Carath\'eodory theorem on the bidisk states that if the Julia quotient is bounded along some sequence…

In [2], the authors prove Stillman's conjecture in all characteristics and all degrees by showing that, independent of the algebraically closed field $K$ or the number of variables, $n$ forms of degree at most $d$ in a polynomial ring $R$…

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…