相关论文: Monotone Boolean functions capture their primes

Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…

We provide Berry-Esseen bounds for sums of operator-valued Boolean and monotone independent variables, in terms of the first moments of the summands. Our bounds are on the level of Cauchy transforms as well as the L\'evy distance. As…

In the present paper we define the notion of generalized cumulants which gives a universal framework for commutative, free, Boolean, and especially, monotone probability theories. The uniqueness of generalized cumulants holds for each…

Shiu proved that if a and q are arbitrary coprime integers, then there exist arbitrarily long strings of consecutive primes which are all congruent to a modulo q. We generalize Shiu's theorem to imaginary quadratic fields, where we prove…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

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…

The existence of a smooth, nonnegative, compactly supported function with monotone (on the half-line) Fourier transform satisfying two-sided decay bounds is demonstrated.

In this work we cast the problem of binary classification in terms of estimating a partition on Bernoulli data. When the explanatory variables are all categorical, the problem can be modelled using the language of boolean functions. We…

We pose some open problems related to boundedness of real-valued functions on balleans and coarse spaces. Also we prove that the Bergman property of groups is a coarse invariant. A special attention is payed to balleans on groups.

In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2.…

Monotone Boolean functions (MBFs) are Boolean functions $f: {0,1}^n \rightarrow {0,1}$ satisfying the monotonicity condition $x \leq y \Rightarrow f(x) \leq f(y)$ for any $x,y \in {0,1}^n$. The number of MBFs in n variables is known as the…

We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…

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…

In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in…

Idempotent Boolean functions form a highly structured subclass of Boolean functions that is closely related to rotation symmetry under a normal-basis representation and to invariance under a fixed linear map in a polynomial basis. These…

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

We consider a Bayesian method for simultaneous quantile regression on a real variable. By monotone transformation, we can make both the response variable and the predictor variable take values in the unit interval. A representation of…

A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…

We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…

Motivated by existing results, we present some completely monotonic functions involving the polygamma functions.