相关论文: Size of Sets with Small Sensitivity: a Generalizat…

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

We show that for any natural number $s$, there is a constant $\gamma$ and a subgraph-closed class having, for any natural $n$, at most $\gamma^n$ graphs on $n$ vertices up to isomorphism, but no adjacency labeling scheme with labels of size…

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…

We randomly construct various subsets $\Lambda$ of the integers which have both smallness and largeness properties. They are small since they are very close, in various meanings, to Sidon sets: the continuous functions with spectrum in…

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

The sensitivity of a Boolean function f is the maximum over all inputs x, of the number of sensitive coordinates of x. The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean…

A family of vectors $A \subset [k]^n$ is said to be intersecting if any two elements of $A$ agree on at least one coordinate. We prove, for fixed $k \ge 3$, that the size of a symmetric intersecting subfamily of $[k]^n$ is $o(k^n)$, which…

Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been…

We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…

We prove lower bounds for the Minimum Circuit Size Problem (MCSP) in the Sum-of-Squares (SoS) proof system. Our main result is that for every Boolean function $f: \{0,1\}^n \rightarrow \{0,1\}$, SoS requires degree $\Omega(s^{1-\epsilon})$…

We study a basic problem of approximating the size of an unknown set $S$ in a known universe $U$. We consider two versions of the problem. In both versions the algorithm can specify subsets $T\subseteq U$. In the first version, which we…

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

We show that unbounded fan-in boolean formulas of depth $d+1$ and size $s$ have average sensitivity $O(\frac{1}{d}\log s)^d$. In particular, this gives a tight $2^{\Omega(d(n^{1/d}-1))}$ lower bound on the size of depth $d+1$ formulas…

Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

We introduce a theoretical framework for understanding and predicting the complexity of sequence classification tasks, using a novel extension of the theory of Boolean function sensitivity. The sensitivity of a function, given a…

Erd\H{o}s and Graham proposed to determine the number of subsets $S \subseteq \left\{1,2,\dots,n\right\}$ with $\sum_{s \in S} 1/s = 1$ and asked, among other things, whether that number could be as large as $2^{n - o(n)}$. We show that the…

We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…