Related papers: New Lower Bounds against Homogeneous Non-Commutati…

We prove two new upper bounds for depth-2 linear circuits computing the $N$th disjointness matrix $D^{\otimes N}$. First, we obtain a circuit of size $O\big(2^{1.24485N}\big)$ over $\{0,1\}$. Second, we obtain a circuit of degree…

The constraint of a progressive decrease in residual renormalization scale dependence with increasing loop order is developed as a method for obtaining bounds on unknown higher-order perturbative corrections to renormalization-group…

We prove that Sherali-Adams with polynomially bounded coefficients requires proofs of size $n^{\Omega(d)}$ to rule out the existence of an $n^{\Theta(1)}$-clique in Erd\H{o}s-R\'{e}nyi random graphs whose maximum clique is of size $d\leq…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

A notorious open question in circuit complexity is whether Boolean operations of arbitrary arity can efficiently be expressed using modular counting gates only. H{\aa}stad's celebrated switching lemma yields exponential lower bounds for the…

There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…

For any natural $d \ge k \ge 2$ we calculate the cohomology groups of the space of homogeneous polynomials $R^2 \to R$ of degree $d$, which do not vanish with multiplicity $\ge k$ on real lines. For $k=2$ this problem provides the simplest…

This paper aims at investigating necessary (and sufficient) conditions for quasilinear systems of first order PDEs to be Hamiltonian, with non-homogeneous operators of order 1 + 0, also with degenerate leading coefficient. As a byproduct,…

Let $P$ be a fixed homogeneous polynomial. We present a sharp condition on $P$ guaranteeing the existence of asymptotically larger bounds in Bombieri's inequality, so for every homogeneous polynomial $q_m$ of degree $m$ we have…

In this paper we consider the problem of finding ``as many edge-disjoint Hamilton cycles as possible'' in the binomial random digraph $D_{n,p}$. We show that a typical $D_{n,p}$ contains precisely the minimum between the minimum out- and…

Type B 3-fold supersymmetry is a necessary and sufficient condition for a quantum Hamiltonian to admit three linearly independent local solutions in closed form. We show that any such a system is invariant under GL(3,C) homogeneous linear…

We prove several results on homogeneous plurisubharmonic polynomials on $\mathbb{C}^n$, $n\in\mathbb{Z}_{\geq 2}$. Said results are relevant to the problem of constructing local bumpings at boundary points of pseudoconvex domains of finite…

We consider multilinear Littlewood polynomials, polynomials in $n$ variables in which a specified set of monomials $U$ have $\pm 1$ coefficients, and all other coefficients are $0$. We provide upper and lower bounds (which are close for $U$…

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

Let $G$ be the interior domain of a piecewise analytic Jordan curve without cusps. Let $\{p_n\}_{n=0}^\infty$ be the sequence of polynomials that are orthonormal over $G$ with respect to the area measure, with each $p_n$ having leading…

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})$…

Given any $\varepsilon>0$, we construct an orthonormal system of $n_k$ uniformly bounded polynomials of degree at most $k$ on the unit sphere in $\mathbb R^{m+1}$ where $n_k$ is bigger than $1-\varepsilon$ times the dimension of the space…

We find a new lower bound for the maximal number of zeros to harmonic polynomials, $p(z)+\overline{q(z)}$, when ${\rm deg}\, p = n$ and ${\rm deg}\, q = n-2$.

Shannon proved that almost all Boolean functions require a circuit of size $\Theta(2^n/n)$. We prove a quantum analog of this classical result. Unlike in the classical case the number of quantum circuits of any fixed size that we allow is…