Related papers: Juntas in the $\ell^{1}$-grid and Lipschitz maps b…

In a recent paper, T. Austin has proved an analogous theorem for the continuous torus of the original Junta theorem proved by Friedgut in the case of the Boolean cube. Analogous statements have been established recently in discrete cases…

Let $(X,d)$ be a compact metric space and $\mu$ a Borel probability on $X$. For each $N\geq 1$ let $d^N_\infty$ be the $\ell_\infty$-product on $X^N$ of copies of $d$, and consider $1$-Lipschitz functions $X^N\to\mathbb{R}$ for…

We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k}$ is a junta if $k \geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree $d$ functions for arbitrary finite $A$, and for functions on…

Leveraging tools of De, Mossel, and Neeman [FOCS, 2019], we show two different results pertaining to the \emph{tolerant testing} of juntas. Given black-box access to a Boolean function $f:\{\pm1\}^{n} \to \{\pm1\}$, we give a $poly(k,…

We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x…

The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junta theorem and the invariance principle. In these results the…

We establish that every $K$-quasiconformal mapping of $w$ of the unit disk $\ID$ onto a $C^2$-Jordan domain $\Omega$ is Lipschitz provided that $\Delta w\in L^p(\ID)$ for some $p>2$. We also prove that if in this situation $K\to 1$ with…

The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…

This papers considers the junta testing problem in a recently introduced ``relative error'' variant of the standard Boolean function property testing model. In relative-error testing we measure the distance from $f$ to $g$, where $f,g:…

We prove the following stability version of the edge isoperimetric inequality for the cube: any subset of the cube with average boundary degree within $K$ of the minimum possible is $\varepsilon $-close to a union of $L$ disjoint cubes,…

We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas. Our structure theorem implies that such functions are…

We prove a $k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))}$ lower bound for adaptively testing whether a Boolean function is $\varepsilon_1$-close to or $\varepsilon_2$-far from $k$-juntas. Our results provide the first superpolynomial…

We give the first super-polynomial (in fact, mildly exponential) lower bounds for tolerant testing (equivalently, distance estimation) of monotonicity, unateness, and juntas with a constant separation between the "yes" and "no" cases.…

We provide an example of a monotone Boolean function on the hypercube given by a low depth decision tree that is not well approximated by any k-junta for small k.

We study discrete $\beta$-ensembles as introduced in [17]. We obtain rigidity estimates on the particle locations, i.e. with high probability, the particles are close to their classical locations with an optimal error estimate. We prove the…

Let $U$ be a bounded open subset of the complex plane and let $A_{\alpha}(U)$ denote the set of functions analytic on $U$ that also belong to the little Lipschitz class with Lipschitz exponent $\alpha$. It is shown that if $A_{\alpha}(U)$…

Let $A$ be an abelian variety defined over a number field $K$. For a finite extension $L/K$, the cardinality of the group $A(L)_{\operatorname{tors}}$ of torsion points in $A(L)$ can be bounded in terms of the degree $[L:K]$. We study the…

We investigate the approximability of several classes of real-valued functions by functions of a small number of variables ({\em juntas}). Our main results are tight bounds on the number of variables required to approximate a function…

We consider the problem of deciding whether an $n$-qubit unitary (or $n$-bit Boolean function) is $\varepsilon_1$-close to some $k$-junta or $\varepsilon_2$-far from every $k$-junta, where $k$-junta unitaries act non-trivially on at most…

We give an alternative, simple method to prove isoperimetric inequalities over the hypercube. In particular, we show: 1. An elementary proof of classical isoperimetric inequalities of Talagrand, as well as a stronger isoperimetric result…