English
Related papers

Related papers: The Entropy Influence Conjecture Revisited

200 papers

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

Combinatorics · Mathematics 2022-11-29 Justin Gilmer

In [7], Kwapie\'{n} announced that every mean zero function $f\in L_\infty[0,1]$ can be written as a coboundary $f = g\circ T -g$ for some $g\in L_\infty[0,1]$ and some measure preserving transformation $T$ of $[0,1]$. Whereas the original…

Dynamical Systems · Mathematics 2019-12-02 Aleksei F. Ber , Matthijs J. Borst , Fedor A. Sukochev

The combinatorial basis of entropy, given by Boltzmann, can be written $H = N^{-1} \ln \mathbb{W}$, where $H$ is the dimensionless entropy, $N$ is the number of entities and $\mathbb{W}$ is number of ways in which a given realization of a…

Classical Physics · Physics 2009-11-13 Robert K. Niven

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Computational Complexity · Computer Science 2015-02-05 Chia-Jung Lee , Satya V. Lokam , Shi-Chun Tsai , Ming-Chuan Yang

In 2008, Cusick {\it et al.} conjectured that certain elementary symmetric Boolean functions of the form $\sigma_{2^{t+1}l-1, 2^t}$ are the only nonlinear balanced ones, where $t$, $l$ are any positive integers, and…

Information Theory · Computer Science 2015-03-20 Wei Su , Xiaohu Tang , Alexander Pott

Strassen's asymptotic rank conjecture [Progr. Math. 120 (1994)] claims a strong submultiplicative upper bound on the rank of a three-tensor obtained as an iterated Kronecker product of a constant-size base tensor. The conjecture, if true,…

Data Structures and Algorithms · Computer Science 2023-10-19 Andreas Björklund , Petteri Kaski

Let $F$ be a vectorial Boolean function from $\mathbb{F}_2^n$ to $\mathbb{F}_2^m$, with $m \geq n$. We define $F$ as an embedding if $F$ is injective. In this paper, we examine the component functions of $F$, focusing on constant and…

Cryptography and Security · Computer Science 2025-05-29 Augustine Musukwa , Massimiliano Sala

Building on the recent work of Johnson (2007) and Yu (2008), we prove that entropy is a concave function with respect to the thinning operation T_a. That is, if X and Y are independent random variables on Z_+ with ultra-log-concave…

Information Theory · Computer Science 2009-09-24 Yaming Yu , Oliver Johnson

The starting point for this work is the family of functions $\overline{p}_{-t}(n)$ which counts the number of $t$--colored overpartitions of $n.$ In recent years, several infinite families of congruences satisfied by $\overline{p}_{-t}(n)$…

Number Theory · Mathematics 2024-05-30 James A. Sellers

We consider a random generalisation of the classical Fibonacci substitution. The substitution we consider is defined as the rule mapping $\mathtt{a}\mapsto \mathtt{baa}$ and $\mathtt{b} \mapsto \mathtt{ab}$ with probability $p$ and…

Combinatorics · Mathematics 2015-06-15 Johan Nilsson

In the framework of the planar Euler problem in the quasi--periodic regime, the formulae of the periods available in the literature are simple only on one side of their singularity. In this paper, we complement such formulae with others,…

Dynamical Systems · Mathematics 2026-04-30 Gabriella Pinzari

This note is concerned with an extension, at second order, of an inequality on the discrete cube $C_n=\{-1,1\}$ (equipped with the uniform measure) due to Talagrand (\cite{TalL1L2}). As an application, the main result of this note is a…

Probability · Mathematics 2019-10-22 Kevin Tanguy

We provide a simple proof of a curious inequality for the binary entropy function, an inequality that has been used in two different contexts. In the 1980's, Boppana used this entropy inequality to prove lower bounds on Boolean formulas.…

Combinatorics · Mathematics 2023-01-25 Ravi B. Boppana

It was recently conjectured by Vivo, Pato, and Oshanin [Phys. Rev. E 93, 052106 (2016)] that for a quantum system of Hilbert dimension $mn$ in a pure state, the variance of the von Neumann entropy of a subsystem of dimension $m\leq n$ is…

Mathematical Physics · Physics 2017-08-11 Lu Wei

We investigate the influences of variables on a Boolean function $f$ based on the quantum Bernstein-Vazirani algorithm. A previous paper (Floess et al. in Math. Struct. in Comp. Science 23: 386, 2013) has proved that if a $n$-variable…

Data Structures and Algorithms · Computer Science 2015-01-21 Hong-Wei Li , Li Yang

The random Fibonacci chain is a generalisation of the classical Fibonacci substitution and is defined as the rule mapping $0\mapsto 1$ and $1 \mapsto 01$ with probability $p$ and $1 \mapsto 10$ with probability $1-p$ for $0<p<1$ and where…

Combinatorics · Mathematics 2010-01-21 Johan Nilsson

A real valued function $f$ defined on a real open interval $I$ is called $\Phi$-monotone if, for all $x,y\in I$ with $x\leq y$ it satisfies $$ f(x)\leq f(y)+\Phi(y-x), $$ where $\Phi:[0,\ell(I)[\,\to\mathbb{R}_+$ is a given nonnegative…

Classical Analysis and ODEs · Mathematics 2020-11-23 Angshuman R. Goswami , Zsolt Páles

Functions satisfying the functional equation \begin{align*} \sum_{r=0}^{n-1} (-1)^r f(x+ry, ny) = f(x,y), \quad \text{for any positive odd integer $n$}, \end{align*} are named the alternating invariant functions. Examples of such functions…

Number Theory · Mathematics 2025-09-10 Haiqing Zhu , Su Hu , Min-Soo Kim

A new sharp inequality featuring the differential R\'enyi entropy, the R\'enyi divergence and the R\'enyi cross-entropy of a pair of probability density functions is established. The equality is reached when one of the probability density…

Information Theory · Computer Science 2026-03-10 Razvan Gabriel Iagar , David Puertas-Centeno

Let $Q$ be a relatively compact subset in a Hilbert space $V$. For a given $\e>0$ let $N(\e,Q)$ be the minimal number of linear measurements, sufficient to reconstruct any $x \in Q$ with the accuracy $\e$. We call $N(\e,Q)$ a sampling…

Classical Analysis and ODEs · Mathematics 2013-08-14 D. Batenkov , O. Friedland , Y. Yomdin
‹ Prev 1 8 9 10 Next ›