Related papers: An Improved Upper Bound for the Most Informative B…

A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat in a unified way both a low and a high rate cases. In particular, the earlier known upper bounds are improved, and a…

A Boolean function $f:\{0,1\}^d \mapsto \{0,1\}$ is unate if, along each coordinate, the function is either nondecreasing or nonincreasing. In this note, we prove that any nonadaptive, one-sided error unateness tester must make…

Jensen's inequality is ubiquitous in measure and probability theory, statistics, machine learning, information theory and many other areas of mathematics and data science. It states that, for any convex function $f\colon K \to \mathbb{R}$…

We derive generic information-theoretic and PAC-Bayesian generalization bounds involving an arbitrary convex comparator function, which measures the discrepancy between the training and population loss. The bounds hold under the assumption…

We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability $1/2$. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound,…

Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper, we investigate whether evolutionary computation can evolve…

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

We study the convolution function $$ C[f(x)] := \int_1^x f(y)f({x\over y}) {{\rm d} y\over y} $$ when $f(x)$ is a suitable number-theoretic error term. Asymptotics and upper bounds for $C[f(x)]$ are derived from mean square bounds for…

The best bounds of the form $B(\alpha,\beta,\gamma,x)=(\alpha+\sqrt{\beta^2+\gamma^2 x^2})/x$ for ratios of modified Bessel functions are characterized: if $\alpha$, $\beta$ and $\gamma$ are chosen in such a way that…

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions,…

For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

In the paper, the authors discover the best constants $\alpha_{1}$, $\alpha_{2}$, $\beta_{1}$, and $\beta_{2}$ for the double inequalities $$ \alpha_{1}\bar{C}(a,b)+(1-\alpha_{1}) A(a,b)< T(a,b) <\beta_{1} \bar{C}(a,b)+(1-\beta_{1})A(a,b)…

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.

For $0<q\le 2,\ 1\le k < n,$ let $X=(X_1,...,X_n)$ and $Y=(Y_1,...,Y_n)$ be symmetric $q$-stable random vectors so that the joint distributions of $X_1,...,X_k$ and $X_{k+1},...,X_n$ are equal to the joint distributions of $Y_1,...,Y_k$ and…

The classical Benjamin and Lighthill conjecture about steady water waves states that the non-dimensional flow force constant of a solution is bounded by the corresponding constants of the supercritical and subcritical uniform streams…

A Boolean function $f({\vec x})$ is sensitive to bit $x_i$ if there is at least one input vector $\vec x$ and one bit $x_i$ in $\vec x$, such that changing $x_i$ changes $f$. A function has sensitivity $s$ if among all input vectors, the…

The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the $\ell_\infty$-norm over the Boolean hypercube. We show that the approximate degree of the Bipartite Perfect Matching…

We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…

We present novel bounds on the capacity of the independent and identically distributed binary deletion channel. Four upper bounds are obtained by providing the transmitter and the receiver with genie-aided information on suitably-defined…