English
Related papers

Related papers: On the Courtade-Kumar conjecture for certain class…

200 papers

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

In this paper, we prove that the Fourier entropy of an $n$-dimensional boolean function $f$ can be upper-bounded by $O(I(f)+ \sum\limits_{k\in[n]}I_k(f)\log \frac{1}{I_k(f)})$, where $I(f)$ is its total influence and $I_k(f)$ is the…

Combinatorics · Mathematics 2025-12-11 Xiao Han

Let $A_n$ be a random symmetric matrix with Bernoulli $\{\pm 1\}$ entries. For any $\kappa>0$ and two real numbers $\lambda_1,\lambda_2$ with a separation $|\lambda_1-\lambda_2|\geq \kappa n^{1/2}$ and both lying in the bulk…

Probability · Mathematics 2025-04-23 Yi Han

We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single…

Information Theory · Computer Science 2011-06-01 Arvind Yedla , Henry D. Pfister , Krishna Narayanan

We prove rigorously a source coding theorem that can probably be considered folklore, a generalization to arbitrary alphabets of a problem motivated by the Information Bottleneck method. For general random variables $(Y, X)$, we show…

Information Theory · Computer Science 2018-05-02 Georg Pichler , Günther Koliander

We formulate a plausible conjecture for the optimal Ehrhard-type inequality for convex symmetric sets with respect to the Gaussian measure. Namely, letting $J_{k-1}(s)=\int^s_0 t^{k-1} e^{-\frac{t^2}{2}}dt$ and $c_{k-1}=J_{k-1}(+\infty)$,…

Metric Geometry · Mathematics 2022-02-08 Galyna V. Livshyts

Let $f_1, f_2, ..., f_n$ be a family of independent copies of a given random variable f in a probability space $(\Omega, \mathcal{F}, \mu)$. Then, the following equivalence of norms holds whenever $1 \le q \le p < \infty$…

Operator Algebras · Mathematics 2007-07-30 Marius Junge , Javier Parcet

We study the problem of characterizing when two memoryless binary asymmetric channels, described by their transition probabilities $(p,q)$ and $(p',q')$, are equivalent from the point of view of maximum likelihood decoding (MLD) when…

Information Theory · Computer Science 2018-03-20 Claudio Qureshi , Sueli I. R. Costa , Christiane B. Rodrigues , Marcelo Firer

For a Boolean function $\Phi\colon\{0,1\}^d\to\{0,1\}$ and an assignment to its variables $\mathbf{x}=(x_1, x_2, \dots, x_d)$ we consider the problem of finding the subsets of the variables that are sufficient to determine the function…

Computational Complexity · Computer Science 2019-06-19 Stephan Wäldchen , Jan Macdonald , Sascha Hauch , Gitta Kutyniok

We consider a polynomial $P\in \mathbb{R}[x_{1},\cdots, x_{d}]$ of degree $ \delta $ that depends non-trivially on each of $x_1,...,x_d$ with $d\geq 2$. For any integer $t$ with $2\leq t\leq d$, any natural number $n \in \mathbb{N}$, and…

Combinatorics · Mathematics 2026-03-09 Yewen Sun

A recent discovery of Eldan and Gross states that there exists a universal $C>0$ such that for all Boolean functions $f:\{-1,1\}^n\to \{-1,1\}$, $$ \int_{\{-1,1\}^n}\sqrt{s_f(x)}d\mu(x) \ge C\text{Var}(f)\sqrt{\log…

Functional Analysis · Mathematics 2025-12-02 Paata Ivanisvili , Haonan Zhang

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

Combinatorics · Mathematics 2018-01-12 Francis N. Castro , Oscar E. González , Luis A. Medina

We first study some properties of images of commuting differential operators of polynomial algebras of order one with constant leading coefficients. We then propose what we call the image conjecture on these differential operators and show…

Complex Variables · Mathematics 2010-05-25 Wenhua Zhao

We present a simple Bellman function proof of a bilinear estimate for elliptic operators in divergence form with real coefficients and with nonnegative potentials. The constants are dimension-free. The $p$-range of applicability of this…

Classical Analysis and ODEs · Mathematics 2011-06-01 Oliver Dragičević , Alexander Volberg

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

Probability · Mathematics 2010-11-09 Per Austrin , Elchanan Mossel

The present paper is devoted to the second part of our project on asymmetric maximal inequalities, where we consider martingales in continuous time. Let $(\mathcal M,\tau)$ be a noncommutative probability space equipped with a continuous…

Probability · Mathematics 2016-11-07 Guixiang Hong , Marius Junge , Javier Parcet

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $\sigma$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf…

Probability · Mathematics 2007-05-23 Iosif Pinelis

The binary asymmetric channel is a model for practical communication systems where the error probabilities for symbol transitions $0\rightarrow 1$ and $1\rightarrow0$ differ substantially. In this paper, we introduce the notion of…

Information Theory · Computer Science 2026-04-10 Shukai Wang , Cuiling Fan , Chunming Tang , Zhengchun Zhou

Let $g:\mathbb{N}\to\{-1,1\}$ be a completely multiplicative function, $\mu$ be the M\"obius function and $\mu_2^2(n)$ be the indicator that $n$ is cubefree. We prove that $f=\mu^2g$ and $f=\mu_2^2g$ have unbounded partial sums. Our proofs…

Number Theory · Mathematics 2021-09-14 Marco Aymone

In this paper we establish some criteria to decide when a discrete memoryless channel admits a metric in such a way that the maximum likelihood decoding coincides with the nearest neighbour decoding. In particular we prove a conjecture…

Information Theory · Computer Science 2018-03-20 Claudio M. Qureshi