Related papers: Explicit SoS lower bounds from high-dimensional ex…
We construct an explicit family of 3-XOR instances hard for $\Omega(n)$-levels of the Sum-of-Squares (SoS) semi-definite programming hierarchy. Not only is this the first explicit construction to beat brute force search (beyond low-order…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
We give new bounds on the cosystolic expansion constants of several families of high dimensional expanders, and the known coboundary expansion constants of order complexes of homogeneous geometric lattices, including the spherical building…
In the noisy $k$-XOR problem, one is given $y \in \mathbb{F}_2^M$ and must distinguish between $y$ uniform and $y = A x + e$, where $A$ is the adjacency matrix of a $k$-left-regular bipartite graph with $N$ variables and $M$ constraints,…
In this paper, we present a new construction of simplicial complexes of subpolynomial degree with arbitrarily good local spectral expansion. Previously, the only known high-dimensional expanders (HDXs) with arbitrarily good expansion and…
In this work we introduce a new notion of expansion in higher dimensions that is stronger than the well studied cosystolic expansion notion, and is termed {\em Collective-cosystolic expansion}. We show that tensoring two cosystolic…
We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known…
The Sum-of-Squares (SoS) hierarchy, also known as Lasserre hierarchy, has emerged as a promising tool in optimization. However, it remains unclear whether fixed-degree SoS proofs can be automated [O'Donnell (2017)]. Indeed, there are…
Cosystolic expansion is a high-dimensional generalization of the Cheeger constant for simplicial complexes. Originally, this notion was motivated by the fact that it implies the topological overlapping property, but more recently it was…
We give a simple interpretation of the adapted complex structure of Lempert-Szoke and Guillemin-Stenzel: it is given by a polar decomposition of the complexified manifold. We then give a twistorial construction of an SO(3)-invariant…
We examine a family of three-dimensional exponential sums with monomials and provide estimates which are in some instances sharper than those stemming from approaches entailing the use of existing bounds pertaining to analogous sums.
We give the first construction of explicit constant-degree lossless vertex expanders. Specifically, for any $\varepsilon > 0$ and sufficiently large $d$, we give an explicit construction of an infinite family of $d$-regular graphs where…
The $3$SUM-Indexing problem was introduced as a data structure version of the $3$SUM problem, with the goal of proving strong conditional lower bounds for static data structures via reductions. Ideally, the conjectured hardness of…
Expander graphs have been intensively studied in the last four decades. In recent years a high dimensional theory of expanders has emerged, and several variants have been studied. Among them stand out coboundary expansion and topological…
We construct K3 surfaces over number fields that have good reduction everywhere. These do not exists over the rational numbers, by results of Abrashkin and Fontaine. Our surfaces exist for three quadratic number fields, and an infinite…
Exactly solvable rationally-extended radial oscillator potentials, whose wavefunctions can be expressed in terms of Laguerre-type exceptional orthogonal polynomials, are constructed in the framework of $k$th-order supersymmetric quantum…
Suppose we are given an $n$-dimensional order-3 symmetric tensor $T \in (\mathbb{R}^n)^{\otimes 3}$ that is the sum of $r$ random rank-1 terms. The problem of recovering the rank-1 components is possible in principle when $r \lesssim n^2$…
We construct the first explicit (i.e., non-random) examples of Salem sets in $\mathbb{R}^n$ of arbitrary prescribed Hausdorff dimension. This completely resolves a problem proposed by Kahane more than 60 years ago. The construction is based…
The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…
We study Kloosterman sums on the orthogonal groups $SO_{3,3}$ and $SO_{4,2}$, associated to short elements of their respective Weyl groups. An explicit description for these sums is obtained in terms of multi-dimensional exponential sums.…