Related papers: Counting inequivalent monotone Boolean functions

In this work, we consider a new type of Fourier-like representation of Boolean function $f\colon\{+1,-1\}^n\to\{+1,-1\}$ \[ f(x) = \cos\left(\pi\sum_{S\subseteq[n]}\phi_S \prod_{i\in S} x_i\right). \] This representation, which we call the…

One approach to probabilistic inference involves counting the number of models of a given Boolean formula. Here, we are interested in inferences involving higher-order objects, i.e., functions. We study the following task: Given a Boolean…

For a broad class of integral functionals defined on the space of $n$-dimensional convex bodies, we establish necessary and sufficient conditions for monotonicity, and necessary conditions for the validity of a Brunn-Minkowski type…

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

An extremal point of a positive threshold Boolean function $f$ is either a maximal zero or a minimal one. It is known that if $f$ depends on all its variables, then the set of its extremal points completely specifies $f$ within the universe…

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Solutions of a diophantine equation $f(a,b) = g(c,d)$, with $a,b,c,d$ in some finite range, can be efficiently enumerated by sorting the values of $f$ and $g$ in ascending order and searching for collisions. This article considers functions…

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

Any monotone Boolean circuit computing the $n$-dimensional Boolean convolution requires at least $n^2$ and-gates. This precisely matches the obvious upper bound.

We investigate monotone operator functions of several variables under a trace or a trace-like functional. In particular, we prove the inequality \tau(x_1... x_n)\le\tau(y_1... y_n) for a trace \tau on a C^*-algebra and abelian n-tuples…

We prove two conjectures on correlation inequalities for functions that are linear combinations of unimodal Boolean monotone nondecreasing functions

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…

Let $V_n$ be the number of equivalence classes of invertible maps from $\{0,1\}^n$ to $\{0,1\}^n$, under action of permutation of variables on domain and range. So far, the values $V_n$ have been known for $n\le 6$. This paper describes the…

We show that a positive homogeneous function that is invariant under determinant-1 stochastic local operations and classical communication (SLOCC) transformations defines an N-qubit entanglement monotone if and only if the homogeneous…

This paper investigates the learnability of the nonlinearity property of Boolean functions using neural networks. We train encoder style deep neural networks to learn to predict the nonlinearity of Boolean functions from examples of…

This paper studies the problem of testing whether a function is monotone from a nonparametric Bayesian perspective. Two new families of tests are constructed. The first uses constrained smoothing splines, together with a hierarchical…

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…

The Motzkin numbers $M_n=\sum_{k=0}^n\binom n{2k}\binom{2k}k/(k+1)$ $(n=0,1,2,\ldots)$ and the central trinomial coefficients $T_n$ ($n=0,1,2,\ldots)$ given by the constant term of $(1+x+x^{-1})^n$, have many combinatorial interpretations.…

Let $n \in \N$ and $M_n$ be the algebra of $n \times n$ matrices. We call a function $f$ matrix monotone of order $n$ or $n$-monotone in short whenever the inequality $f(a) \leq f(b)$ holds for every pair of selfadjoint matrices $a, b \in…