相关论文: A Lower Bound on the Number of Boolean Functions w…

Correlation functions in the restricted primitive model are calculated within a field-theoretic approach in the one-loop self-consistent Hartree approximation. The correlation functions exhibit damped oscillatory behavior as found before in…

We present a regularity lemma for Boolean functions $f:\{-1,1\}^n \to \{-1,1\}$ based on noisy influence, a measure of how locally correlated $f$ is with each input bit. We provide an application of the regularity lemma to weaken the…

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 improve results of Kahn, Kalai, and Linial from the late 80s on the existence of influential large coalitions for Boolean functions, and we give counterexamples to conjectures (of Benny Chor and others) also from the late 80s, by…

We give an alternative proof of a conjecture of Bollob\'as, Brightwell and Leader, first proved by Peter Allen, stating that the number of boolean functions definable by 2-SAT formulae is $(1+o(1))2^{\binom{n+1}{2}}$. One step in the proof…

We extend the one-body phase function upper bound on the superfluid fraction in a periodic solid (a spatially ordered supersolid) to include two-body phase correlations. The one-body current density is no longer proportional to the gradient…

For any natural number $n\in\mathbb{N}$, $ \frac{1}{2n+\frac1{1-\gamma}-2}\le \sum_{i=1}^n\frac1i-\ln n-\gamma<\frac{1}{2n+\frac13}, $ where $\gamma=0.57721566490153286...m$ denotes Euler's constant. The constants $\frac{1}{1-\gamma}-2$ and…

In this expository note we highlight the correlation function method as a unified approach in proving both hydrodynamic limits and fluctuation limits for reaction diffusion particle systems. For simplicity we focus on the case when the…

Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…

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 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.

For a set $A$ of nonnegative integers, let $R_2(A,n)$ denote the number of solutions to $n=a+a'$ with $a,a'\in A$, $a<a'$. Let $A_0$ be the Thue-Morse sequence and $B_0=\mathbb{N}\setminus A_0$. Let $A\subset \mathbb{N}$ and $N$ be a…

We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of polynomial threshold functions. More specifically, for a Boolean function f on n variables equal to the sign of a real, multivariate polynomial…

Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to compute various Boolean functions have been developed. As each…

Let $\{X_{k,i};i\geq 1,k\geq 1\}$ be an array of i.i.d. random variables and let $\{p_n;n\geq 1\}$ be a sequence of positive integers such that $n/p_n$ is bounded away from 0 and $\infty$. For $W_n=\max_{1\leq i<j\leq…

Let $ E=\{ (1, b_1, \ldots , b_n)\in R^{n+1} \mid \; b_i= \pm 1 ,\; i=1, \ldots, n \}$, $E^{\times n}_{\ne 0} := \{ W=(w_{i_1}, \ldots , w_{i_n}) \mid w_{i_k}\in E, \, k=1, \ldots, n, \, dim \, span(w_{i_1}, \ldots , w_{i_n}) = n \},$ and…

Let $m,n\ge 2$, $m\le n$. It is well-known that the number of (two-dimensional) threshold functions on an $m\times n$ rectangular grid is {eqnarray*} t(m,n)=\frac{6}{\pi^2}(mn)^2+O(m^2n\log{n})+O(mn^2\log{\log{n}})=…

Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…

Fix a positive integer $N$. Select an additive composition $\xi$ of $N$ uniformly out of $2^{N-1}$ possibilities. The interplay between the number of parts in $\xi$ and the maximum part in $\xi$ is our focus. It is not surprising that…

Let $\mathcal{A}$ be a set of mutually coprime positive integers, satisfying \begin{align*} \sum\limits_{a\in\mathcal{A}}\frac{1}{a} = \infty. \end{align*} Define the (possibly non-multiplicative) "Liouville-like" functions \begin{align*}…