Related papers: A new bound for the Fourier-Entropy-Influence conj…
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…
In this paper we obtain new sufficient conditions for representation of a function as an absolutely convergent Fourier integral. Unlike those known earlier, these conditions are given in terms of belonging to weighted spaces. Adding weights…
Let X_1,..., X_n be independent Bernoulli random variables and $f$ a function on {0,1}^n. In the well-known paper (Talagrand1994) Talagrand gave an upper bound for the variance of f in terms of the individual influences of the X_i's. This…
We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…
The Courtade-Kumar conjecture posits that dictatorship functions maximize the mutual information between the function's output and a noisy version of its input over the Boolean hypercube. We present two significant advancements related to…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
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…
In this article, we address the lower bounds for the sums $a_f(p)+a_g(p)$ of the $p$-th Fourier coefficients of two twist-inequivalent, non-CM normalized newforms $f$ and $g$. Our main result shows that for such forms with integer Fourier…
In this paper, we study non-trivial upper bounds for the sum $\sum \limits_{n \in S} |\lambda_f(n)|$ where $f$ is a normalized Maass eigencusp form for the full modular group, $\lambda_f(n)$ is the $n$th normalized Fourier coefficient of…
Quantum Fano inequality (QFI) in quantum information theory provides an upper bound to the entropy exchange by a function of the entanglement fidelity. We give various Fano-like upper bounds to the entropy exchange and QFI is a special case…
A celebrated theorem of Friedgut says that every function $f:\{0,1\}^n \to \{0,1\}$ can be approximated by a function $g:\{0,1\}^n \to \{0,1\}$ with $\|f-g\|_2^2 \le \epsilon$ which depends only on $e^{O(I_f/\epsilon)}$ variables where…
The paper focuses on the behaviour of unimodular Fourier multipliers with exponential growth in the context of weighted $L^p$-spaces. Our main result shows that much of the general theory of multipliers is approachable through the theory of…
Let f be an entire function with a bounded set of singular values, and suppose furthermore that the postsingular set of f is bounded. We show that every component of the escaping set I(f) is unbounded. This provides a partial answer to a…
For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…
In 1992 Mansour proved that every size-$s$ DNF formula is Fourier-concentrated on $s^{O(\log\log s)}$ coefficients. We improve this to $s^{O(\log\log k)}$ where $k$ is the read number of the DNF. Since $k$ is always at most $s$, our bound…
Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $\mu_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the…
We prove bounds for the absolute sum of all level-$k$ Fourier coefficients for $(-1)^{p(x)}$, where polynomial $p:\mathbf{F}_2^n \to \mathbf{F}_2$ is of degree $1$ or degree $2$.
Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…
Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem for over 40 years. An early result by Morgenstern from 1973, provides an $\Omega(n…
Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulates that the maximum sensitivity of a Boolean function is…