Related papers: Separations between Combinatorial Measures for Tra…
The (e,n)-complexity functions describe total instability of trajectories in dynamical systems. They reflect an ability of trajectories going through a Borel set to diverge on the distance $\epsilon$ during the time interval n. Behavior of…
In this paper we study the separation between two complexity measures: the degree of a Boolean function as a polynomial over the reals and its block sensitivity. We show that separation between these two measures can be improved from $…
Block sensitivity ($bs(f)$), certificate complexity ($C(f)$) and fractional certificate complexity ($C^*(f)$) are three fundamental combinatorial measures of complexity of a boolean function $f$. It has long been known that $bs(f) \leq…
Boolean functions with symmetry properties are interesting from a complexity theory perspective; extensive research has shown that these functions, if nonconstant, must have high `complexity' according to various measures. In recent work of…
A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…
In this paper, we introduce concepts of separable functions in balls and in the whole space, and develop a new method to investigate the qualitative properties of separable functions. We first study the axial symmetry and monotonicity of…
We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…
We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…
Given a sequence of Boolean functions $(f_n)_{n \geq 1}$, $f_n \colon \{ 0,1 \}^{n} \to \{ 0,1 \}$, and a sequence $(X^{(n)})_{n\geq 1} $ of continuous time $p_n $-biased random walks $ X^{(n)} = (X_t^{(n)})_{t \geq 0}$ on $ \{ 0,1 \}^{n}$,…
A Boolean function $f({\vec x})$ is sensitive to bit $x_i$ if there is at least one input vector $\vec x$ and one bit $x_i$ in $\vec x$, such that changing $x_i$ changes $f$. A function has sensitivity $s$ if among all input vectors, the…
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…
Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…
We construct a noise stable sequence of transitive, monotone increasing Boolean functions $f_n: \{-1,1\}^{k_n} \longrightarrow \{-1,1\}$ which admit many pivotals with high probability. We show that such a sequence is volatile as well, and…
A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all $x_1$,..., $x_n$ to…
For any pair of bounded observables $A$ and $B$ with pure point spectra, we construct an associated "joint observable" which gives rise to a notion of a joint (projective) measurement of $A$ and $B$, and which conforms to the intuition that…
The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the…
Spatio-temporal covariances are important for describing the spatio-temporal variability of underlying random processes in geostatistical data. For second-order stationary processes, there exist subclasses of covariance functions that…
This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…
Determining the maximal separation between sensitivity and block sensitivity of Boolean functions is of interest for computational complexity theory. We construct a sequence of Boolean functions with bs(f) = 1/2 s(f)^2 + 1/2 s(f). The best…
Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the functions in this class can have excellent properties, making…