Related papers: When are sequences of Boolean functions tame?

A sequence $(x_n)$ on the torus is said to have Poissonian pair correlations if $\# \{1\le i\neq j\le N: |x_i-x_j| \le s/N\}=2sN(1+o(1))$ for all reals $s>0$, as $N\to \infty$. It is known that, if $(x_n)$ has Poissonian pair correlations,…

We say that a sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ has Poissonian pair correlations if \begin{equation*} \lim_{N \to \infty} \frac{1}{N} \# \lbrace 1 \leq l \neq m \leq N: \| x_l - x_m \| \leq \frac{s}{N} \rbrace = 2s…

We consider a sequence $(p_n)_{n=1}^\infty$ of polynomials with uniformly bounded zeros and $\deg p_1\geq 1$, $\deg p_n\geq 2$ for $n\geq 2$, satisfying certain asymptotic conditions. We prove that the function sequence $\left(\frac{1}{\deg…

The dominated convergence theorem implies that if (f_n) is a sequence of functions on a probability space taking values in the interval [0,1], and (f_n) converges pointwise a.e., then the sequence of integrals converges to the integral of…

We consider Ewens random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$ and to study the asymptotic behaviour as $n\to\infty$. We obtain very precise information on the joint distribution of…

Let $(X,d)$ be a metric space and $f_{1,\infty}=\{f_n\}_{i=0}^{\infty}$ be a sequence of continuous maps $f_n:X\rightarrow X$ such that $(f_n)$ converges uniformly to a continuous map $f$. We investigate which conditions ensure that the…

In this paper, our primary objective is to study a possible decomposition of an approximately convex sequence. For a given $\varepsilon>0$; a sequence $\big<u_n\big>_{n=0}^{\infty}$ is said to be $\varepsilon$-convex, if for any…

This work brings techniques from the theory of recurrent integer sequences to the problem of balancedness of symmetric Boolean functions. In particular, the periodicity modulo $p$ ($p$ odd prime) of exponential sums of symmetric Boolean…

We discuss a problem of Arnold, whether every function is stably equivalent to one which is non-degenerate for its Newton diagram. We argue that the answer is negative. We describe a method to make functions non-degenerate after…

A function $f:N\rightarrow N$ is sublinear, if \[\lim_{x\rightarrow +\infty}\frac{f(x)}{x}=0.\] If $A$ is an Abelian group, $G$ is a graph and $\phi$ is an $A$-flow in $G$, then let $N(\phi)$ be the nullity of $\phi$, that is, the set of…

We study two conjectures posed in the analysis of Boolean functions $f : \{-1, 1\}^n \to \{-1, 1\}$, in both of which, the Majority function plays a central role: the "Majority is Least Stable" (Benjamini et al., 1999) and the…

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…

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

Let $\{X, X_{n}; n \geq 1 \}$ be a sequence of i.i.d. $\mathbf{B}$-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. This note is devoted to study the classical central limitr theorem for subsequences of sums of…

We study the probability of Boolean functions with small max influence to become constant under random restrictions. Let $f$ be a Boolean function such that the variance of $f$ is $\Omega(1)$ and all its individual influences are bounded by…

Let $T_{\epsilon}$ be the noise operator acting on Boolean functions $f:\{0, 1\}^n\to \{0, 1\}$, where $\epsilon\in[0, 1/2]$ is the noise parameter. Given $\alpha>1$ and fixed mean $\mathbb{E} f$, which Boolean function $f$ has the largest…

We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…

A sequence of graphs is FO-convergent if the probability of satisfaction of every first-order formula converges. A graph modeling is a graph, whose domain is a standard probability space, with the property that every definable set is Borel.…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

We prove that if $f(x) = \sum_{k=0}^\infty a_k x^k,$ $a_k >0, $ is an entire function such that the sequence $Q := \left( \frac{a_k^2}{a_{k-1}a_{k+1}} \right)_{k=1}^\infty$ is non-decreasing and $\frac{a_1^2}{a_{0}a_{2}} \geq 2\sqrt[3]{2},$…