Related papers: Talagrand-Type Correlation Inequalities for Submod…

A Boolean function $f:\{0,1\}^n \to \{0,1\}$ is said to be noise sensitive if inserting a small random error in its argument makes the value of the function almost unpredictable. Benjamini, Kalai and Schramm showed that if the sum of…

Building on the inequalities for homogeneous tetrahedral polynomials in independent Gaussian variables due to R. Lata{\l}a we provide a concentration inequality for non-necessarily Lipschitz functions $f\colon \R^n \to \R$ with bounded…

We explore incompressible homogeneous isotropic turbulence within the (fourth-order model) formulation of optimal control and optimization, in contrast to the classical works of Proudman and Reid (1954) and Tatsumi (1957), with the…

Let $X = \{1,-1\}^\mathbb{N}$ be the symbolic space endowed with the product order. A Borel probability measure $\mu$ over $X$ is said to satisfy the FKG inequality if for any pair of continuous increasing functions $f$ and $g$ we have…

We prove a version of Talagrand's concentration inequality for subordinated sub-Laplacian on a compact Riemannian manifold using tools from noncommutative geometry. As an application, motivated by quantum information theory, we show that on…

Let $f$ and $g$ be spectrally normalized holomorphic newforms of even weight $k \geq2$ on $\Gamma_0(q)$. If $f\neq g$, then assume that $q$ is squarefree. For a nice test function $\psi$ supported on $\Gamma_0(1)\backslash\mathbb{H}$, we…

We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…

We derive weighted log-Sobolev inequalities from a class of super Poincar\'e inequalities. As an application, the Talagrand inequality with larger distances are obtained. In particular, on a complete connected Riemannian manifold, we prove…

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

We compute the correlation functions for antiferromagnetic and d-wave superconducting fermion bilinears in a generalized mean field type approximation for the Hubbard model. For high temperature our explicit expressions show that…

We prove the sharp isoperimetric inequality $$ \mathbb{E} \,h_{A}^{\log_{2}(3/2)} \geq \mu(A)^{*} (\log_{2}(1/\mu(A)^{*}))^{\log_{2}(3/2)} $$ for all sets $A \subseteq \{0,1\}^n$, where $\mu$ denotes the uniform probability measure,…

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…

Under the Ornstein-Uhlenbeck semigroup $\{U_t\}$, any non-negative measurable $f : \mathbb R^n \to \mathbb R_+$ exhibits a uniform tail bound better than that implied by Markov's inequality and conservation of mass: For every $\alpha \geq…

We show that Talagrand's transport inequality is equivalent to a restricted logarithmic Sobolev inequality. This result clarifies the links between these two important functional inequalities. As an application, we give the first proof of…

The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…

Assuming the Generalized Riemann Hypothesis, we provide uniform upper bounds with explicit main terms for moduli of $\left(\cL'/\cL\right)(s)$ and $\log{\cL(s)}$ for $1/2+\delta\leq\sigma<1$, fixed $\delta\in(0,1/2)$ and for functions in…

The Fourier Entropy-Influence (FEI) conjecture of Friedgut and Kalai [FK96] seeks to relate two fundamental measures of Boolean function complexity: it states that $H[f] \leq C Inf[f]$ holds for every Boolean function $f$, where $H[f]$…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, our primary goal is to study the asymptotic behavior of the finite differences of the logarithm of the overpartition function, i.e., $(-1)^{r-1}\Delta^r \log \p(n)$, by…

The Large Hadron Collider provides a unique opportunity to study quantum entanglement and violation of Bell inequalities at the highest energy available today. In this paper, we will investigate these quantum correlations with top quark…

We prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every…