Related papers: Majority-closed minions of Boolean functions
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…
It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a…
We obtain multi-soliton solutions of the time-dependent Bogoliubov-de Gennes equations or, equivalently, Gorkov equations that describe the dynamics of a fermionic condensate in the dissipationless regime. There are two kinds of solitons -…
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…
Following the paper~[3] by V\"{a}\"{a}n\"{a}nen and the author, we continue to investigate on the difference between Boolean-valued second-order logic and full second-order logic. We show that the compactness number of Boolean-valued…
We report that defocusing cubic media with spatially inhomogeneous nonlinearity, whose strength increases rapidly enough toward the periphery, can support stable bright localized modes. Such nonlinearity landscapes give rise to a variety of…
For functions belonging to the classes $C^{2}[0, 1]$ and $C^{3}[0, 1]$, we establish the lower estimate with an explicit constant in approximation by Bernstein polynomials in terms of the second order Ditzian-Totik modulus of smoothness.…
We define two natural classes of functions, called 2-open and 2-closed, that are closest to open and closed functions. We show that they have the following property: there are $X_i \subset X$ $ (i=1,2,...$) such that $f|X_i$ are open or…
Frobenius monoidal functors preserve duals. We show that conversely, (co)monoidal functors between autonomous categories which preserve duals are Frobenius monoidal. We apply this result to linearly distributive functors between autonomous…
We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to…
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…
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…
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…
In a paper of Jason Swanson, a CLT for the sample median of independent Brownian motions with value 0 at 0 was proved. Here we extend this result in two ways. We prove such a result for a collection of self-similar processes which include…
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…
We claim that the cube category whose morphisms are the interval-preserving monotone functions between finite Boolean lattices is a convenient general-purpose site for cubical sets. This category is the largest possible concrete…
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…
In this paper, the author presents algorithms that allow determining the number of fixed points in permutations of a set of monotone Boolean functions. Then, using Burnside's lemma, the author determines the number of inequivalent monotone…
In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, \( f_n \colon \{ -1,1 \}^n \to \{ -1,1 \} \) were introduced. We continue their study of how these definitions relate to…