相关论文: Monotone Boolean functions capture their primes
We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…
We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.
We study Boolean functions of an arbitrary number of input variables that can be realized by simple iterative constructions based on constant-size primitives. This restricted type of construction needs little global coordination or control…
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in…
In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.
In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The…
The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…
We consider the problem of exact identification for read-once functions over arbitrary Boolean bases. We introduce a new type of queries (subcube identity ones), discuss its connection to previously known ones, and study the complexity of…
Physical implementations of digital computers began in the latter half of the 1930's and were first constructed from various forms of logic gates. Based on the prime numbers, we introduce prime clocks and prime clock sums, where the clocks…
We study quantum algorithms for the hidden shift problem of complex scalar- and vector-valued functions on finite abelian groups. Given oracle access to a shifted function and the Fourier transform of the unshifted function, the goal is to…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…
We investigate the upper bounds of nodal sets for solutions of bi-Laplace equations without using frequency functions which play an essential role in the study of nodal sets in the celebrated work by Logunov \cite{Lo18}. We obtain some…
The summatory function of the number of binomial coefficients not divisible by a prime is known to exhibit regular periodic oscillations, yet identifying the less regularly behaved minimum of the underlying periodic functions has been open…
n this paper, we state several conjectures regarding distribution of primes and of pairs of primes represented by irreducible homogeneous polynomial in two variables $f(a,b)$. We formulate conjectures with respect to the slope $t=b/a$ for…
We show improved monotonicity testers for the Boolean hypercube under the $p$-biased measure, as well as over the hypergrid $[m]^n$. Our results are: 1. For any $p\in (0,1)$, for the $p$-biased hypercube we show a non-adaptive tester that…
A principal curve serves as a powerful tool for uncovering underlying structures of data through 1-dimensional smooth and continuous representations. On the basis of optimal transport theories, this paper introduces a novel principal curve…
In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…
It is proved an amplification of Cusick-Cheon's conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2^m, in the cases where k = 1 or k >= (m-1)/2.