Related papers: Influential coalitions for Boolean Functions
We show that any sequence of well-behaved (e.g. bounded and non-constant) real-valued functions of $n$ boolean variables $\{f_n\}$ admits a sequence of coordinates whose $L^1$ influence under the $p$-biased distribution, for any…
The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…
The number of $n$-ary balanced correlation immune (resilient) Boolean functions of order $\frac{n}{2}$ is not less than $n^{2^{(n/2)-2}(1+o(1))}$ as $n\rightarrow\infty$. Keywords: resilient function, correlation immune function, orthogonal…
The preceding theory of excluded volume effects is applied to the Daud and coworkers' observations. Based on various researchers' experimental data, it is suggested that the Daud and coworkers' value in the bulk state may be revised from 82…
We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…
When one integrates the q-exponential function of Tsallis' so as to get the partition function $Z$, a gamma function inevitably emerges. Consequently, poles arise. We investigate here here the thermodynamic significance of these poles in…
Let X_1,..., X_n be independent Bernoulli random variables and $f$ a function on {0,1}^n. In the well-known paper (Talagrand1994) Talagrand gave an upper bound for the variance of f in terms of the individual influences of the X_i's. This…
For a restricted class of potentials (harmonic+Gaussian potentials), we express the resolvent integral for the correlation functions of simple traces of powers of complex matrices of size $N$, in term of a determinant; this determinant is…
Coalitional manipulation in voting is considered to be any scenario in which a group of voters decide to misrepresent their vote in order to secure an outcome they all prefer to the first outcome of the election when they vote honestly. The…
We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…
We analyse the large momentum behaviour of 4-dimensional massive euclidean Phi-4-theory using the flow equations of Wilson's renormalization group. The flow equations give access to a simple inductive proof of perturbative…
Effective interactions inherently encompass many-body effects that appear unified. Analyzing these in reverse, that is, separating them into contributions from pairs, triples, or larger groups, is typically intricate and seldom pursued.…
We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The…
The theory of influence and sharp threshold is a key tool in probability and probabilistic combinatorics, with numerous applications. One significant aspect of the theory is directed at identifying the level of generality of the product…
We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…
For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…
A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…
In connection to a conjecture of W. L\"u. Q. Li and C. Yang we prove a result on small function sharing by a power of a meromorphic function with few poles and its derivative. Our results improve a number of known results.