Related papers: An Upper Bound on the Number of Bent Functions
We describe a new construction of Boolean functions. A specific instance of our construction provides a 30-variable Boolean function having min-entropy/influence ratio to be $128/45 \approx 2.8444$ which is presently the highest known value…
The well-known Bennett-Hoeffding bound for sums of independent random variables is refined, by taking into account truncated third moments, and at that also improved by using, instead of the class of all increasing exponential functions,…
From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary…
If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…
We show that any quantum algorithm deciding whether an input function $f$ from $[n]$ to $[n]$ is 2-to-1 or almost 2-to-1 requires $\Theta(n)$ queries to $f$. The same lower bound holds for determining whether or not a function $f$ from…
Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.
We give an explicit upper bound for non-principal Dirichlet $L$-functions on the line $s=1+it$. This result can be applied to improve the error in the zero-counting formulae for these functions.
We investigate the width complexity of nondeterministic unitary OBDDs (NUOBDDs). Firstly, we present a generic lower bound on their widths based on the size of strong 1-fooling sets. Then, we present classically cheap functions that are…
We find a nontrivial upper bound on the average value of the function M(n) which associates to every positive integer n the minimal Hamming weight of a multiple of n. Some new results about the equation M(n)=M(n') are given.
Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…
Bounds for the correlation functions of identical bosons are discussed for the general case of a Gaussian density matrix. In particular, for a purely chaotic system the two-particle correlation function must always be greater than one. On…
In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…
"The Baron's omni-sequence", B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with…
In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…
Directed and undirected graphical models, also called Bayesian networks and Markov random fields, respectively, are important statistical tools in a wide variety of fields, ranging from computational biology to probabilistic artificial…
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…
Bent functions of the form $\mathbb{F}_2^n\rightarrow\mathbb{Z}_q$, where $q\geqslant2$ is a positive integer, are known as generalized bent (gbent) functions. Gbent functions for which it is possible to define a dual gbent function are…
Let $\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
Let $T_{\epsilon}$ be the noise operator acting on functions on the boolean cube $\{0,1\}^n$. Let $f$ be a nonnegative function on $\{0,1\}^n$ and let $q \ge 1$. We upper bound the $\ell_q$ norm of $T_{\epsilon} f$ by the average $\ell_q$…