English
Related papers

Related papers: Talagrand inequality at second order and applicati…

200 papers

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…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

We impose standard $ T1 $-type assumptions on a Calder\'on-Zygmund operator $ T $, and deduce that for bounded compactly supported functions $ f, g $ there is a sparse bilinear form $ \Lambda $ so that $$ \lvert \langle T f, g \rangle\rvert…

Classical Analysis and ODEs · Mathematics 2016-12-20 Michael T. Lacey , Darío Mena

In this paper, we give necessary and sufficient conditions for Talagrand's like transportation cost inequalities on the real line. This brings a new wide class of examples of probability measures enjoying a dimension-free concentration of…

Probability · Mathematics 2007-05-23 Nathael Gozlan

In this article we study generalization of the classical Talagrand transport-entropy inequality in which the Wasserstein distance is replaced by the entropic transportation cost. This class of inequalities has been introduced in the recent…

Probability · Mathematics 2019-07-02 Giovanni Conforti , Luigia Ripani

In this paper, we prove that the discrete Copson inequality (E.T. Copson, \emph{Notes on a series of positive terms}, J. London Math. Soc., 2 (1927), 49-51) of one-dimension in general cases admits an improvement. In fact we study the…

Classical Analysis and ODEs · Mathematics 2025-08-04 Bikram Das , Atanu Manna

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…

Cryptography and Security · Computer Science 2023-09-21 Jinjie Gao , Haibin Kan , Yuan Li , Jiahua Xu , Qichun Wang

We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…

Probability · Mathematics 2019-06-11 Vilhelm Agdur

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…

Functional Analysis · Mathematics 2018-07-25 Li Gao , Marius Junge , Nicolas LaRacuente

In a recent paper, T. Austin has proved an analogous theorem for the continuous torus of the original Junta theorem proved by Friedgut in the case of the Boolean cube. Analogous statements have been established recently in discrete cases…

Probability · Mathematics 2017-02-03 Raphaël Bouyrie

By using the theory of first-order differential subordination for functions with fixed initial coefficient, several well-known results for subclasses of univalent functions are improved by restricting the functions to have fixed second…

Complex Variables · Mathematics 2012-08-02 Sumit Nagpal , V. Ravichandran

In this paper, we present a new Carleman estimate for the adjoint equations associated to a class of super strong degenerate parabolic linear problems. Our approach considers a standard geometric imposition on the control domain, which can…

Analysis of PDEs · Mathematics 2022-04-22 Bruno S. V. Araújo , Reginaldo Demarque , Luiz Viana

The Friedgut-Kalai-Naor (FKN) theorem states that if $f$ is a Boolean function on the Boolean cube which is close to degree 1, then $f$ is close to a dictator, a function depending on a single coordinate. The author has extended the theorem…

Combinatorics · Mathematics 2020-04-01 Yuval Filmus

We prove new bilinear estimates for the X^{s, b}_\pm(R^2) spaces which are optimal up to endpoints. These estimates are often used in the theory of nonlinear Dirac equations on R^{1+1}. The proof of the bilinear estimates follows from a…

Analysis of PDEs · Mathematics 2012-02-10 Timothy Candy

We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \rightarrow \mathbb{R}$ is self-bounding if for every $x…

Machine Learning · Computer Science 2019-06-04 Vitaly Feldman , Pravesh Kothari , Jan Vondrák

In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…

Quantum Physics · Physics 2010-12-20 Ashley Montanaro , Tobias J. Osborne

We give a proof of Fourier extension conjecture on the paraboloid in all dimensions bigger than 2 that begins with a decomposition suggested in Sawyer [Saw8] of writing a smooth Alpert projection as a sum of pieces whose Fourier extensions…

Classical Analysis and ODEs · Mathematics 2026-05-19 Cristian Rios , Eric T. Sawyer

The goal of the article is to improve constants in the infimum convolution inequalities (IC for short) which were introduced by R. Lata{\l}a and J.O. Wojtaszczyk. We show that the exponential distribution satisfies IC with constant $2$ but…

Probability · Mathematics 2018-01-25 Marcin Małogrosz

We improve the Gagliardo-Nirenberg inequality \[ \|\varphi\|_{L^q(\mathbb{R}^n)} \le C \|\nabla\varphi\|_{L^r(\mathbb{R}^n)} \mathcal{L}^{-(\frac 1q - \frac{n-r}{rn})} (\|\nabla\varphi\|_{L^r(\mathbb{R}^n)}), \] $r=2$,…

Analysis of PDEs · Mathematics 2019-11-05 Marek Fila , Johannes Lankeit

We extend a Gaussian functional inequality to a countable product of Gaussian measures. This inequality improves on the classical Poincare inequality for Gaussian measures. As an application, we prove that First Passage Percolation has…

Probability · Mathematics 2007-05-23 Michel Benaim , Raphael Rossignol

The Fourier-Walsh expansion of a Boolean function $f \colon \{0,1\}^n \rightarrow \{0,1\}$ is its unique representation as a multilinear polynomial. The Kindler-Safra theorem (2002) asserts that if in the expansion of $f$, the total weight…

Combinatorics · Mathematics 2019-01-28 Nathan Keller , Ohad Klein