English
Related papers

Related papers: On the Fourier Entropy Influence Conjecture for Ex…

200 papers

It is well known that if a function $f$ satisfies $$\|f(x) e^{\pi \alpha |x|^2}\|_p + \| \widehat{f}(\xi) e^{\pi \alpha |\xi|^2} \|_q<\infty \qquad\qquad\qquad(*)$$ with $\alpha=1$ and $1\le p,q<\infty$, then $f\equiv 0.$ We prove that if…

Classical Analysis and ODEs · Mathematics 2024-07-09 Miquel Saucedo , Sergey Tikhonov

It is well known that the entropy $H(X)$ of a discrete random variable $X$ is always greater than or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tight…

Information Theory · Computer Science 2017-12-22 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Combinatorics · Mathematics 2011-11-15 Hamed Hatami

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

We prove that for any decision tree calculating a boolean function $f:\{-1,1\}^n\to\{-1,1\}$, \[ \Var[f] \le \sum_{i=1}^n \delta_i \Inf_i(f), \] where $\delta_i$ is the probability that the $i$th input variable is read and $\Inf_i(f)$ is…

Computational Complexity · Computer Science 2007-05-23 Ryan O'Donnell , Michael Saks , Oded Schramm , Rocco A. Servedio

We prove that for any $\alpha\in[0,\omega_1)$ there exists a strongly separately continuous function $f:\ell_\infty\to [0,1]$ such that $f$ belongs to the $(\alpha+1)$'th /$(\alpha+2)$'th/ Baire class and does not belong to the $\alpha$'th…

General Topology · Mathematics 2017-08-29 Olena Karlova , Tomáš Visnyai

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…

Information Theory · Computer Science 2015-06-02 Or Ordentlich , Ofer Shayevitz , Omri Weinstein

We prove that for any prime $\ell$, any finite group has as many irreducible complex characters of degree prime to $\ell$ as the normalizers of its Sylow $\ell$-subgroups. This equality was conjectured by John McKay. The conjecture was…

Representation Theory · Mathematics 2025-05-02 Marc Cabanes , Britta Späth

A function of two variables F(x,y)is universal iff for every other function G(x,y) there exists functions h(x) and k(y) with G(x,y) = F(h(x),k(y)) Sierpinski showed that assuming the continuum hypothesis there exists a Borel function F(x,y)…

Logic · Mathematics 2012-04-25 Paul B. Larson , Arnold W. Miller , Juris Steprans , William A. R. Weiss

Let $\Omega^o$ and $\Omega^i$ be open bounded subsets of $\mathbb{R}^n$ of class $C^{1,\alpha}$ such that the closure of $\Omega^i$ is contained in $\Omega^o$. Let $f^o$ be a function in $C^{1,\alpha}(\partial\Omega^o)$ and let $F$ and $G$…

Analysis of PDEs · Mathematics 2015-01-23 M. Dalla Riva , G. Mishuris

Let $0 < \epsilon < 1/2$ be a noise parameter, and 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$. We upper bound the entropy of $T_{\epsilon}…

Information Theory · Computer Science 2016-06-23 Alex Samorodnitsky

We introduce a new notion of influence for symmetric convex sets over Gaussian space, which we term "convex influence". We show that this new notion of influence shares many of the familiar properties of influences of variables for monotone…

Computational Complexity · Computer Science 2021-09-08 Anindya De , Shivam Nadimpalli , Rocco A. Servedio

We prove the following extension of the Wiener--Wintner Theorem in Ergodic Theor and the Carleson Theorem on pointwise convergence of Fourier series: For all measure preserving flows $ (X,\mu , T_t)$ and $ f\in L^p (X,\mu)$, there is a set…

Classical Analysis and ODEs · Mathematics 2007-05-23 Michael Lacey , Erin Terwilleger

$\newcommand{\sp}{\mathsf{sparsity}}\newcommand{\s}{\mathsf{s}}\newcommand{\al}{\mathsf{alt}}$ The well-known Sensitivity Conjecture states that for any Boolean function $f$, block sensitivity of $f$ is at most polynomial in sensitivity of…

Computational Complexity · Computer Science 2019-02-12 Krishnamoorthy Dinesh , Jayalal Sarma

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

We show a general phenomenon of the constrained functional value for densities satisfying general convexity conditions, which generalizes the observation in Bobkov and Madiman (2011) that the entropy per coordinate in a log-concave random…

Information Theory · Computer Science 2020-10-27 Yanjun Han

In this paper, given a topological space $X$, an interval $I\subseteq {\bf R}$ and five continuous functions $\varphi, \psi, \omega :X\to {\bf R}$, $\alpha, \beta:I\to {\bf R}$, we are interested in the infimum of the function $\Phi:X\to…

Optimization and Control · Mathematics 2024-10-11 Biagio Ricceri

New sufficient conditions for representation of a function via the absolutely convergent Fourier integral are obtained in the paper. In the main result, Theorem 1.1, this is controlled by the behavior near infinity of both the function and…

Classical Analysis and ODEs · Mathematics 2009-06-01 E. Liflyand , R. Trigub

The seminal result of Kahn, Kalai and Linial shows that a coalition of $O(\frac{n}{\log n})$ players can bias the outcome of any Boolean function $\{0,1\}^n \to \{0,1\}$ with respect to the uniform measure. We extend their result to…

Discrete Mathematics · Computer Science 2019-02-21 Yuval Filmus , Lianna Hambardzumyan , Hamed Hatami , Pooya Hatami , David Zuckerman

Causal inference relies on two fundamental assumptions: ignorability and positivity. We study causal inference when the true confounder value can be expressed as a function of the observed data; we call this setting estimation with…

Methodology · Statistics 2021-02-18 Aahlad Puli , Adler J. Perotte , Rajesh Ranganath