Related papers: Unbalancing Sets and an Almost Quadratic Lower Bou…

The set equality problem is to decide whether two sets $A$ and $B$ are equal or disjoint, under the promise that one of these is the case. Some other problems, like the Graph Isomorphism problem, is solvable by reduction to the set quality…

We study the complexity of computing majority as a composition of local functions: \[ \text{Maj}_n = h(g_1,\ldots,g_m), \] where each $g_j :\{0,1\}^{n} \to \{0,1\}$ is an arbitrary function that queries only $k \ll n$ variables and $h :…

In this note, we consider semiclassical scattering on a manifold which is Euclidean near infinity or asymptotically hyperbolic. We show that, if the cut-off resolvent satisfies polynomial estimates in a strip of size $O(h |\log…

We show that Nechiporuk's method for proving lower bound for Boolean formulas can be extended to the quantum case. This leads to an n^2 / log^2 n lower bound for quantum formulas computing an explicit function. The only known previous…

This paper proves the first super-logarithmic lower bounds on the cell probe complexity of dynamic boolean (a.k.a. decision) data structure problems, a long-standing milestone in data structure lower bounds. We introduce a new method for…

We demonstrate a lower bound technique for linear decision lists, which are decision lists where the queries are arbitrary linear threshold functions. We use this technique to prove an explicit lower bound by showing that any linear…

We construct skew corner-free subsets of $[n]^2$ of size $n^2\exp(-O(\sqrt{\log n}))$, thereby improving on recent bounds of the form $\Omega(n^{5/4})$ obtained by Pohoata and Zakharov. In the other direction, we prove that any such set has…

Circuit lower bounds are important since it is believed that a super-polynomial circuit lower bound for a problem in NP implies that P!=NP. Razborov has proved superpolynomial lower bounds for monotone circuits by using method of…

We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…

We prove an asymptotically tight bound (asymptotic with respect to the number of polynomials for fixed degrees and number of variables) on the number of semi-algebraically connected components of the realizations of all realizable sign…

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.

Tavenas has recently proved that any n^{O(1)}-variate and degree n polynomial in VP can be computed by a depth-4 circuit of size 2^{O(\sqrt{n}\log n)}. So to prove VP not equal to VNP, it is sufficient to show that an explicit polynomial in…

For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a…

We consider a question raised by Rudnev: given four pencils of $n$ concurrent lines in $\mathbb R^2$, with the four centres of the pencils non-collinear, what is the maximum possible size of the set of points where four lines meet? Our main…

Our main goal in this paper is to study the number of small-amplitude isolated periodic orbits, so-called limit cycles, surrounding only one equilibrium point a class of polynomial Kolmogorov systems. We denote by $\mathcal M_{K}(n)$ the…

We prove lower bounds for the Minimum Circuit Size Problem (MCSP) in the Sum-of-Squares (SoS) proof system. Our main result is that for every Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$, SoS requires degree $\Omega(s^{1-\epsilon})$…

The dimension of a partially-ordered set $P$ is the smallest integer $d$ such that one can embed $P$ into a product of $d$ linear orders. We prove that the dimension of the divisibility order on the interval $\{1, \dotsc, n\}$ is bounded…

We study the weakly coupled critical elliptic system \begin{equation*} \begin{cases} -\Delta u=\mu_{1}|u|^{2^{*}-2}u+\lambda\alpha |u|^{\alpha-2}|v|^{\beta}u & \text{in }\Omega,\\ -\Delta v=\mu_{2}|v|^{2^{*}-2}v+\lambda\beta…

In this paper we prove the optimal upper bound $\frac{\lambda_{n}}{\lambda_{m}}\leq\frac{n^{2}}{m^{2}}$ $\Big(\lambda_{n}>\lambda_{m}\geq 11\sup\limits_{x\in[0,1]}q(x)\Big)$ for one-dimensional Schrodinger operators with a nonnegative…

We prove that any mixed-integer linear extended formulation for the matching polytope of the complete graph on $n$ vertices, with a polynomial number of constraints, requires $\Omega(\sqrt{\sfrac{n}{\log n}})$ many integer variables. By…