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

Let $G$ be a connected, simply connected, compact semisimple Lie group of dimension $n$. It has been shown by Clerc \cite{Clerc1974} that, for any $f\in L^1(G)$, the Bochner-Riesz mean $S_R^\delta(f)$ converges almost everywhere to $f$,…

We show that some spectral properties of the almost Mathieu operator with frequency well approximated by rationals can be as poor as at all possible in the class of all one-dimensional discrete Schroedinger operators. For the class of…

We prove the following uniform version of a theorem by Lindstr\"om: Let $\mbox{$\cal F$}:=\{F_i:~ i\in I\}$ be a $k$-uniform set family of $[n]$, where $k\geq 1$. If $|\mbox{$\cal F$}|\geq n+1$, then there exist two disjoint subsets $I_1$…

We generalize the celebrated isoperimetric inequality of Khot, Minzer, and Safra~(SICOMP 2018) for Boolean functions to the case of real-valued functions $f \colon \{0,1\}^d\to\mathbb{R}$. Our main tool in the proof of the generalized…

Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…

We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…

It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…

We show that if $G$ is a finite Abelian group and $f$ is an integer-valued map on $G$ with algebra norm at most $M$ then there is some $L < \exp(M^{4+o(1)})$, cosets of (possibly different) subgroups $W_1,...,W_L$, and $s_1,...,s_L \in…

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$ with the goal to approximate a function $f\in\mathcal{C}\left[-1,1\right]$ by a polynomial of degree $n$. We investigate the…

We prove Berry-Esseen theorems and the almost sure invariance principle with rates for partial sums of the form $S_n=\sum_{j=0}^{n-1}f_j\circ T_{j-1}\circ\cdots\circ T_1\circ T_0$ where $f_j$ are functions with uniformly bounded…

A family $\mathcal{F}$ of $k$-subsets of an $n$-set is called $s$-almost $t$-intersecting if each member is $t$-disjoint with at most $s$ members. In this paper, we prove that, if $\left|\mathcal{F}\right|$ is maximum, then $\mathcal{F}$…

It is proved that any continuous function f on the unit circle such that the sequence e^{in f}, n=1,2,... has small Wiener norm \| e^{in f} \|_A = o (\frac{\log^{1/22} |n|}{(\log \log |n|)^{3/11}}), is linear. Moreover, we get lower bounds…

Assuming the Riemann hypothesis, we prove the weak convergence of linear statistics of the zeros of L-functions towards a Gaussian field, with covariance structure corresponding to the $\HH^{1/2}$-norm of the test functions. For this…

If a function $f$, acting on a Euclidean space $\mathbb{R}^n$, is "almost" orthogonally additive in the sense that $f(x+y)=f(x)+f(y)$ for all $(x,y)\in\bot\setminus Z$, where $Z$ is a "negligible" subset of the $(2n-1)$-dimensional manifold…

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…

An $m \times n$ matrix $\mathsf{A}$ with column supports $\{S_i\}$ is $k$-separable if the disjunctions $\bigcup_{i \in \mathcal{K}} S_i$ are all distinct over all sets $\mathcal{K}$ of cardinality $k$. While a simple counting bound shows…

For a set $L$ of positive integers, a set system $\mathcal{F} \subseteq 2^{[n]}$ is said to be $L$-close Sperner, if for any pair $F,G$ of distinct sets in $\mathcal{F}$ the skew distance $sd(F,G)=\min\{|F\setminus G|,|G\setminus F|\}$…

Let $d\in\mathbb N$ and $f$ be a function in the Orlicz class $L(\log^+L)^{d-1}$ defined on the unit cube $[0,1]^d$ in $\mathbb{R}^d$. Given partitions $\Delta_1,\ldots,$ $\Delta_d$ of $[0,1]$, we first prove that the orthogonal projection…

Let $\mathcal{M}$ be a compact $d$-dimensional submanifold of $\mathbb{R}^N$ with reach $\tau$ and volume $V_{\mathcal M}$. Fix $\epsilon \in (0,1)$. In this paper we prove that a nonlinear function $f: \mathbb{R}^N \rightarrow…