Related papers: Characterizing Direct Product Testing via Cobounda…
We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…
The purpose of this article is to develop a machinery to study the capacity of deep neural networks (DNNs) to approximate high-dimensional functions. In particular, we show that DNNs have the expressive power to overcome the curse of…
In this paper, we consider the problem of testing properties of joint distributions under the Conditional Sampling framework. In the standard sampling model, the sample complexity of testing properties of joint distributions is exponential…
A natural problem in high-dimensional inference is to decide if a classifier $f:\mathbb{R}^n \rightarrow \{-1,1\}$ depends on a small number of linear directions of its input data. Call a function $g: \mathbb{R}^n \rightarrow \{-1,1\}$, a…
In partial function extension, we are given a partial function consisting of $n$ points from a domain and a function value at each point. Our objective is to determine if this partial function can be extended to a function defined on the…
We characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…
The idea of detecting the entanglement of a given bipartite state by searching for symmetric extensions of this state was first proposed by Doherty, Parrilo and Spedialeri. The complete family of separability tests it generates, often…
We study the isoperimetric problem in product spaces equipped with the uniform distance. Our main result is a characterization of isoperimetric inequalities which, when satisfied on a space, are still valid for the product spaces, up a to a…
We introduce and study swap cosystolic expansion, a new expansion property of simplicial complexes. We prove lower bounds for swap coboundary expansion of spherical buildings and use them to lower bound swap cosystolic expansion of the LSV…
We study the question of local testability of low (constant) degree functions from a product domain $S_1 \times \dots \times {S}_n$ to a field $\mathbb{F}$, where ${S_i} \subseteq \mathbb{F}$ can be arbitrary constant sized sets. We show…
We establish dimensional thresholds for dot product sets associated with compact subsets of translated paraboloids. Specifically, we prove that when the dimension of such a subset exceeds $ \frac{5}{4} = \frac{3}{2} - \frac{1}{4} $ in…
In a recent work (ECCC, TR18-171, 2018), we introduced models of testing graph properties in which, in addition to answers to the usual graph-queries, the tester obtains {\em random vertices drawn according to an arbitrary distribution…
We present a family of sharpness examples for Falconer-type single dot product results. In particular, for $d\geq 2,$ for any $s<\frac{d+1}{2},$ we construct a Borel probability measure $\mu$ satisfying the energy estimate…
We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a "cubes table" which assigns to every cube a low degree polynomial. The tester randomly selects two cubes…
The Cube versus Cube test is a variant of the well-known Plane versus Plane test of Raz and Safra, in which to each $3$-dimensional affine subspace $C$ of $\mathbb{F}_q^n$, a polynomial of degree at most $d$, $T(C)$, is assigned in a…
We consider the problem of approximately solving constraint satisfaction problems with arity $k > 2$ ($k$-CSPs) on instances satisfying certain expansion properties, when viewed as hypergraphs. Random instances of $k$-CSPs, which are also…
Small set expansion in high dimensional expanders is of great importance, e.g., towards proving cosystolic expansion, local testability of codes and constructions of good quantum codes. In this work we improve upon the state of the art…
Let $X$ be a simplicial complex with $n$ vertices. A missing face of $X$ is a simplex $\sigma\notin X$ such that $\tau\in X$ for any $\tau\subsetneq \sigma$. For a $k$-dimensional simplex $\sigma$ in $X$, its degree in $X$ is the number of…
A simplicial complex $X$ is said to be tight with respect to a field $\mathbb{F}$ if $X$ is connected and, for every induced subcomplex $Y$ of $X$, the linear map $H_\ast (Y; \mathbb{F}) \rightarrow H_\ast (X; \mathbb{F})$ (induced by the…
We study two classes of extension problems, and their interconnections: (i) Extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; (ii) In case of Lie groups, representations of the…