Related papers: Influential coalitions for Boolean Functions
In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number…
A positive correlation inequality is established for circular-invariant plurisubharmonic functions, with respect to complex Gaussian measures. The main ingredients of the proofs are the Ornstein-Uhlenbeck semigroup, and another natural…
In this paper we discuss correlation function computations in massive topological Landau-Ginzburg orbifolds, extending old results of Vafa. We then apply these computations to provide further tests of the nonabelian mirrors proposal and…
We discuss questions related to the non-existence of gaps in the series defining modular forms and other arithmetic functions of various types, and improve results of Serre, Balog and Ono, and Alkan, using new results about exponential sums…
We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…
After an elementary derivation of Bell's inequality, several forms of expectation functions for two-valued observables are discussed. Special emphasis is given to hypothetical stronger-than quantum expectation functions which give rise to a…
Central limit theorems (CLTs) have a long history in probability and statistics. They play a fundamental role in constructing valid statistical inference procedures. Over the last century, various techniques have been developed in…
The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its…
We discuss the effect of boundaries in boundary logarithmic conformal field theory and show, with reference to both $c=-2$ and $c=0$ models, how they produce new features even in bulk correlation functions which are not present in the…
New unconditional estimates of the divisor and totient functions are contributed to the literature. These results are consistent with the Riemann hypothesis and seem to solve the Nicolas inequality for all sufficiently large integers.
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
Causal networks beyond that in the paradigmatic Bell's theorem can lead to new kinds and applications of non-classical behavior. Their study, however, has been hindered by the fact that they define a non-convex set of correlations and only…
Two measures of how near an arbitrary function between groups is to being a homomorphism are considered. These have properties similar to conjugates and commutators. The authors show that there is a rich theory based on these structures,…
In experiments that study social phenomena, such as peer influence or herd immunity, the treatment of one unit may influence the outcomes of others. Such "interference between units" violates traditional approaches for causal inference, so…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…
The largest Hamming distance between a Boolean function in $n$ variables and the set of all affine Boolean functions in $n$ variables is known as the covering radius $\rho_n$ of the $[2^n,n+1]$ Reed-Muller code. This number determines how…
Boole polynomials play an important role in the area of number theory, algebra and umbral calculus. In this paper, we investigate some properties of Boole polynomials and consider Witt-type formulas for the Boole numbers and polynomials.…
In the last few years, many works have tried to explain the predictions of deep learning models. Few methods, however, have been proposed to verify the accuracy or faithfulness of these explanations. Recently, influence functions, which is…