Related papers: On Sharp Thresholds of Monotone Properties: Bourga…
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…
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random geometric graph or hypergraph. As an application we show that a geometric model of random k-SAT exhibits a sharp threshold for…
We give a simple, short and self-contained presentation of Bourgain's discretised projection theorem from 2010, which is a fundamental tool in many recent breakthroughs in geometric measure theory, harmonic analysis, and homogeneous…
We prove an endpoint version of the uniform Sobolev inequalities in Kenig-Ruiz-Sogge [8]. It was known that strong type inequalities no longer hold at the endpoints; however, we show that restricted weak type inequalities hold there, which…
These notes arose from my Cambridge Part III course on Additive Combinatorics, given in Lent Term 2009. The aim was to understand the simplest proof of the Bourgain-Glibichuk-Konyagin bounds for exponential sums over subgroups. As a…
Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…
The purpose of this short note is to demonstrate how some techniques from additive combinatorics recently developed by Peluse and Peluse-Prendiville can be applied to give an alternative proof for a trilinear smoothing inequality originally…
We provide an exposition of the proofs of Bourgain's polynomial ergodic theorems. The focus is on the motivation and intuition behind his arguments.
We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary…
A computational problem exhibits a "gap property" when there is no tractable boundary between two disjoint sets of instances. We establish a Gap Trichotomy Theorem for a family of constraint problem variants, completely classifying the…
In connection with some recent results by J. Bourgain and H. Abdalaoui, M. Lemanczyk, T. De La Rue (ALR) we present a short proof of Bourgain's theorem on Mobius orthogonality property for bounded rank-one constructions. The proof of the…
A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…
We prove an extension of the Bourgain-Sarnak-Ziegler theorem and then apply it to bound certain polynomial exponential sums with modular coefficients.
We give a simple proof of Bourgain's theorem on the singularity of Ornstein's maps.
In two dimensions, Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. We prove an inhomogeneous fibre version of Gallagher's theorem, sharpening and making unconditional a…
We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…
The purpose of this note is to discuss several results that have been obtained in the last decade in the context of sharp adjoint Fourier restriction/Strichartz inequalities. Rather than aiming at full generality, we focus on several…
The main goal of this paper is to generalize Bohr's phenomenon from complex one-dimensional analysis to higher dimensions in the framework of Quaternionic Analysis.
Gallagher's theorem is a sharpening and extension of the Littlewood conjecture that holds for almost all tuples of real numbers. We provide a fibre refinement, solving a problem posed by Beresnevich, Haynes and Velani in 2015. Hitherto,…
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usually called Boolean constraint satisfaction problems) and…