Related papers: Monotone Boolean functions capture their primes
The 93 minions of Boolean functions stable under left composition with the clone of self-dual monotone functions are described. As an easy consequence, all $(C_1,C_2)$-stable classes of Boolean functions are determined for an arbitrary…
Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…
A probability distribution over the Boolean cube is monotone if flipping the value of a coordinate from zero to one can only increase the probability of an element. Given samples of an unknown monotone distribution over the Boolean cube, we…
Let $D_n$ denote the set of monotone Boolean functions with $n$ variables. Elements of $D_n$ can be represented as strings of bits of length $2^n$. Two elements of $D_0$ are represented as 0 and 1 and any element $g\in D_n$, with $n>0$, is…
We consider classes of Boolean functions stable under compositions both from the right and from the left with clones. Motivated by the question how many properties of Boolean functions can be defined by means of linear equations, we focus…
In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
The near-unanimity-closed minions of Boolean functions, i.e., the clonoids whose target algebra contains a near-unanimity function, are completely described. The key concept towards this result is the minorant-minor partial order and its…
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…
Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.
A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…
The information processing abilities of a multilayer neural network with a number of hidden units scaling as the input dimension are studied using statistical mechanics methods. The mapping from the input layer to the hidden units is…
One matrix structure in the area of monotone Boolean functions is defined here. Some of its combinatorial, algebraic and algorithmic properties are derived. On the base of these properties, three algorithms are built. First of them…
This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…
Extending Sparks's theorem, we determine the cardinality of the lattice of $(C_1,C_2)$-clonoids of Boolean functions in the cases where the target clone $C_2$ is the clone of projections. Moreover, we explicitly describe the…
We present a few algorithms and methods to count fixes of permutations acting on monotone Boolean functions. Some of these methods was used by Pawelski \cite{P} to compute the number of inequivalent monotone Boolean functions with 8…
In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…
The convex hull $P_{n}$ of a Gaussian sample $X_{1},...,X_{n}$ in $R^{d}$ is a Gaussian polytope. We prove that the expected number of facets $E f_{d-1} (P_n)$ is monotonically increasing in $n$. Furthermore we prove this for random…
In this paper, we prove a theorem on the distribution of primes in cubic progressions on average.
We show that the coefficients of the representing polynomial of any monotone Boolean function are the values of the M\"obius function of an atomistic lattice related to this function. Using this we determine the representing polynomial of…