Related papers: On depth-3 circuits and covering number: an explic…

We investigate the space complexity of refuting $3$-CNFs in Resolution and algebraic systems. No lower bound for refuting any family of $3$-CNFs was previously known for the total space in resolution or for the monomial space in algebraic…

In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree $n$ in $n^2$ variables such that any homogeneous depth 4 arithmetic circuit…

We show that cancellation of free modules holds in the stable class $\Omega_3(\mathbb{Z})$ over dihedral groups of order $4n$. In light of a recent result on realizing $k$-invariants for these groups, this completes the proof that all all…

The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in the design and analysis of algorithms in high dimensional geometry. Most known constructions of linear embeddings that satisfy the…

Hartsfield and Ringel constructed orientable quadrangular embeddings of the complete graph $K_n$ for $n\equiv 5 \pmod 8$, and nonorientable ones for $n \ge 9$ and $n\equiv 1 \pmod 4$. These provide minimal quadrangulations of their…

We study depth lower bounds against non-monotone circuits, parametrized by a new measure of non-monotonicity: the orientation of a function $f$ is the characteristic vector of the minimum sized set of negated variables needed in any…

For every $n >0$, we show the existence of a CNF tautology over $O(n^2)$ variables of width $O(\log n)$ such that it has a Polynomial Calculus Resolution refutation over $\{0,1\}$ variables of size $O(n^3polylog(n))$ but any Polynomial…

We propose a conjecture regarding the integrally closedness of lattice polytopes with large lattice lengths. We demonstrate that a lattice simplex in dimension 3 (resp. 4) with lattice length of at least 2 (resp. 3 and no edge has lattice…

We consider the following question: Given a connected open domain $\Omega\subset R^n$, suppose $u,v:\Omega\rightarrow R^n$ with $\det(\nabla u)>0$, $\det(\nabla v)>0$ a.e. are such that $\nabla u^T(x)\nabla u(x)=\nabla v(x)^T \nabla v(x)$…

Let $M$ be an open Riemann surface and let $\Lambda\subset M$ be a closed discrete subset. In this paper, we prove the existence of complete conformal minimal immersions $M\to\mathbb{R}^n$, $n\ge 3$, with prescribed values on $\Lambda$ and…

We exhibit a randomized algorithm which given a matrix $A\in \mathbb{C}^{n\times n}$ with $\|A\|\le 1$ and $\delta>0$, computes with high probability an invertible $V$ and diagonal $D$ such that $\|A-VDV^{-1}\|\le \delta$ using…

In this paper we construct a cyclically invariant Boolean function whose sensitivity is $\Theta(n^{1/3})$. This result answers two previously published questions. Tur\'an (1984) asked if any Boolean function, invariant under some transitive…

We study invertible matrix solutions $A$ to the equation $A^{-1}\overline\partial A=\omega^{(0,1)}$ on a small open subset $U$ of the closure $\overline M$ of a domain $M\subset{\mathbf C}^n$, where $\omega^{(0,1)}$ is a matrix of $(0,1)$…

An ordered biclique partition of the complete graph $K_n$ on $n$ vertices is a collection of bicliques (i.e., complete bipartite graphs) such that (i) every edge of $K_n$ is covered by at least one and at most two bicliques in the…

Let O be a compact orientable 3-orbifold with non-empty singular locus and a finite volume hyperbolic structure. (Equivalently, O is the quotient of hyperbolic 3-space by a lattice in PSL(2,C) with torsion.) Then we prove that O has a tower…

We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…

We give a simple proof of why there is a Matrix theory approximation for a membrane shaped like an arbitrary Riemann surface. As corollaries, we show that noncompact membranes cannot be approximated by matrices and that the Poisson algebra…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

We show that every language in NP has a PCP verifier that tosses $O(\log n)$ random coins, has perfect completeness, and a soundness error of at most $1/\text{poly}(n)$, while making at most $O(\text{poly}\log\log n)$ queries into a proof…

For a positive integer $\ell$, let $b_{\ell}(n)$ denote the number of $\ell$-regular partitions of a nonnegative integer $n$. Motivated by some recent conjectures of Keith and Zanello, we establish infinite families of congruences modulo…