相关论文: A Lower Bound on the Number of Boolean Functions w…
The full hierarchy of multiple-point correlation functions for diffusion-limited annihilation, A + A -> 0, is obtained analytically and explicitly, following the method of intervals. In the long time asymptotic limit, the correlation…
For a restricted class of potentials (harmonic+Gaussian potentials), we express the resolvent integral for the correlation functions of simple traces of powers of complex matrices of size $N$, in term of a determinant; this determinant is…
We obtain the following results. For any prime $q$ the minimal Hamming distance between distinct regular $q$-ary bent functions of $2n$ variables is equal to $q^n$. The number of $q$-ary regular bent functions at the distance $q^n$ from the…
We propose a recursive algorithm for the calculation of multi-baryon correlation functions that combines the advantages of a recursive approach with those of the recently proposed unified contraction algorithm. The independent components of…
In this correspondence, an equivalent definition of algebraic immunity of Boolean functions is posed, which can clear up the confusion caused by the proof of optimal algebraic immunity of the Carlet-Feng function and some other functions…
Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…
We establish a lower bound for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a Boolean formula to represent each…
We prove a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…
A new recursion formula is presented for the correlation functions of the integrable spin 1/2 XXX chain with inhomogeneity. It relates the correlators involving n consecutive lattice sites to those with n-1 and n-2 sites. In a series of…
A coloring of the $q$-ary $n$-dimensional cube (hypercube) is called perfect if, for every $n$-tuple $x$, the collection of the colors of the neighbors of $x$ depends only on the color of $x$. A Boolean-valued function is called…
We show examples of total Boolean functions that depend on $n$ variables and have spectral sensitivity $\Theta(\sqrt{\log n})$, which is asymptotically minimal. Our main new function combines the Hamming code with the Boolean address…
It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal points, i.e. minimal ones and maximal zeros. We show that f has exactly n + 1 extremal points if and only if it is linear read-once. The…
We investigate the mean-field limit for interacting particle systems through a duality-based framework and obtain quantitative estimates on the convergence of marginals as well as on correlation functions. In particular, for merely…
Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…
The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…
We study the influence of a possible coherent component in the boson source on the two-, three- and $n$-particle correlation functions in a generalized core/halo type of boson-emitting source. In particular, a simple formula is presented…
We establish a lower bound of $2^n$ conditional branches for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a…
We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…
Algebraic and fast algebraic attacks are power tools to analyze stream ciphers. A class of symmetric Boolean functions with maximum algebraic immunity were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the notion of…
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…