Related papers: Boolean functions on $S_n$ which are nearly linear

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

For a function $f$ on the hypercube $\{0,1\}^n$ with Fourier expansion $f=\sum_{S\subseteq[n]}\hat f(S)\chi_S$, the hypercontractive inequality allows bounding norms of $T_\rho f=\sum_S\rho^{|S|} \hat f(S)\chi_S$ in terms of norms of $f$.…

We prove an almost sure central limit theorem on the Poisson space, which is perfectly tailored for stabilizing functionals emerging in stochastic geometry. As a consequence, we provide almost sure central limit theorems for $(i)$ the total…

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

As main result we prove strong convergence theorems of Vilenkin-Fej\'er means when $0<p\leq 1/2.$

The famous Carleson-Hunt theorem has been in focus of interest for a long time. This theorem concerns convergence almost everywhere of Fourier series of $f\in L_p$ functions for $1<p\leq \infty.$ Kolmogorov constructed a function $f\in L_1$…

We prove that, to compute a Boolean function $f$ on $N$ variables with error probability $\epsilon$, any quantum black-box algorithm has to query at least $\frac{1 - 2\sqrt{\epsilon}}{2} \rho_f N = \frac{1 - 2\sqrt{\epsilon}}{2} \bar{S}_f$…

Let $f$ be a holomorphic, or even meromorphic, function on the unit disc. Plessner's theorem then says that, for almost every boundary point $\zeta $, either (i) $f$ has a finite nontangential limit at $\zeta $, or (ii) the image $f(S)$ of…

Let $X$ and $Y$ be two smooth manifolds of the same dimension. It was proved by Seeger, Sogge and Stein in \cite{SSS} that the Fourier integral operators with real non-degenerate phase functions in the class $I^{\mu}_1(X,Y;\Lambda),$…

We prove a new sharp correlation inequality for sums of i.i.d. square integrable lattice distributed random variables. We also apply it to establish an almost sure local limit theorem for iid square integrable random variables taking values…

A uniformly bounded complete orthonormal system of functions $\Theta =\{ \theta_n\}_{n=1}^{\infty},$ $ \|\theta_n\|_{L^\infty_{[0,1]} } \leq M $ is constructed such that $\sum_{n=1}^{\infty} a_{n}\theta_{n}$ converges almost everywhere on…

Simon's problem asks the following: determine if a function $f: \{0,1\}^n \rightarrow \{0,1\}^n$ is one-to-one or if there exists a unique $s \in \{0,1\}^n$ such that $f(x) = f(x \oplus s)$ for all $x \in \{0,1\}^n$, given the promise that…

The aim of this article is to generalize the notion of the cut locus and to get the structure theorem for it. For this purpose, we first introduce a class of 1-Lipschitz functions, each member of which is called an {\it almost distance…

We prove that if $u:\mathbb{R}^n\to\mathbb{R}$ is strongly convex, then for every $\varepsilon>0$ there is a strongly convex function $v\in C^2(\mathbb{R}^n)$ such that $|\{u\neq v\}|<\varepsilon$ and $\Vert u-v\Vert_\infty<\varepsilon$.

The $\epsilon$-approximate degree $deg_\epsilon(f)$ of a Boolean function $f$ is the least degree of a real-valued polynomial that approximates $f$ pointwise to error $\epsilon$. The approximate degree of $f$ is at least $k$ iff there…

Let $k$ be a perfect field of characteristic $p>0$, $\mathcal{V}$ a complete discrete valuation ring with residue field $k$ and field of fractions $K$ of characteristic 0, and $S$ a separated $k$-scheme of finite type. When $S$ is smooth…

We generalize the family of $\alpha$-divergences using a pair of strictly comparable weighted means. In particular, we obtain the $1$-divergence in the limit case $\alpha\rightarrow 1$ (a generalization of the Kullback-Leibler divergence)…

We propose a new approach for approximating functions in $C([0,1]^d)$ via Kolmogorov superposition theorem (KST) based on the linear spline interpolation of the outer function in the Kolmogorov representation. We improve the results in…

Let $S_n$ be the symmetric group on $n$ points. Deza and Frankl [M. Deza and P. Frankl, On the maximum number of permutations with given maximal or minimal distance, J. Combin. Theory Ser. A 22 (1977) 352--360] proved that if ${\cal F}$ is…