Related papers: FKN Theorem on the biased cube
Given a bilinear (or sub-bilinear) operator $B$, we prove restricted weighted weak type inequalities of the form $$ ||B(f_1, f_2)||_{L^{p, \infty}(w_1^{p/p_1}w_2^{p/p_2})}\lesssim ||f_1||_{L^{p_1, 1}(w_1)}||f_2||_{L^{p_2, 1}(w_2)}, $$…
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.
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to…
We consider tilings $(\mathcal{Q},\Phi)$ of $\mathbb{R}^d$ where $\mathcal{Q}$ is the $d$-dimensional unit cube and the set of translations $\Phi$ is constrained to lie in a pre-determined lattice $A \mathbb{Z}^d$ in $\mathbb{R}^d$. We…
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…
We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…
Bernstein processes are Brownian diffusions that appear in Euclidean Quantum Mechanics. Knowledge of the symmetries of the Hamilton-Jacobi-Bellman equation associated with these processes allows one to obtain relations between stochastic…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
The Fourier coefficients F(t) of a function f on a compact symmetric space U/K are given by integration of f against matrix coefficients of irreducible representations of U. The coefficients depend on a spectral parameter t, which…
We consider various definitions of degrees of discrete functions and establish relations between the number of relevant (essential) variables and degrees of two- and three-valued functions. Keywords: relevant variable, sensitivity, degree…
Depending on the parity of $n$ and the regularity of a bent function $f$ from $\mathbb F_p^n$ to $\mathbb F_p$, $f$ can be affine on a subspace of dimension at most $n/2$, $(n-1)/2$ or $n/2- 1$. We point out that many $p$-ary bent functions…
We study the convergence of a discretized Fourier orthogonal expansion in orthogonal polynomials on $B^2 \times [-1,1]$, where $B^2$ is the closed unit disk in $\RR^2$. The discretized expansion uses a finite set of Radon projections and…
We prove an invariance principle for functions on a slice of the Boolean cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our invariance principle shows that a low-degree, low-influence function has similar distributions…
On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…
We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…
We identify an assumption on linear forms $\phi_1, \dots, \phi_k: \mathbb{F}_p^n \to \mathbb{F}_p$ that is much weaker than approximate joint equidistribution on the Boolean cube $\{0,1\}^n$ and is in a sense almost as weak as linear…
We prove a Quantitative Functional Central Limit Theorem for one-hidden-layer neural networks with generic activation function. The rates of convergence that we establish depend heavily on the smoothness of the activation function, and they…
Relations between the decision tree complexity and various other complexity measures of Boolean functions is a thriving topic of research in computational complexity. It is known that decision tree complexity is bounded above by the cube of…
Using Talagrand's concentration inequality on the discrete cube {0,1}^m we show that given a real-valued function Z(x)on {0,1}^m that satisfies certain monotonicity conditions one can control the deviations of Z(x) above its median by a…
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…