Related papers: Maximal inequality for high-dimensional cubes
We survey recent results on first-passage processes in unbounded cones and their applications to ordering of particles undergoing Brownian motion in one dimension. We first discuss the survival probability S(t) that a diffusing particle, in…
We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…
We show that every cubic bridgeless graph with n vertices has at least 3n/4-10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.
In this appendix to our paper with the same title posted on arxiv we give a quick proof of an inequality that can be substituted to Hastings's result, quoted as Lemma 1.9 in our previous paper. Our inequality is less sharp but also appears…
We study the random simple connected cubic planar graph $\mathsf{C}_n$ with an even number $n$ of vertices. We show that the Brownian map arises as Gromov--Hausdorff--Prokhorov scaling limit of $\mathsf{C}_n$ as $n \in 2 \ndN$ tends to…
In 1986 A. Ancona showed, using the Koebe one-quarter Theorem, that for a simply-connected planar domain the constant in the Hardy inequality with the distance to the boundary is greater than or equal to 1/16. In this paper we consider…
Consider the partially ordered set on $[t]^n:=\{0,\dots,t-1\}^n$ equipped with the natural coordinate-wise ordering. Let $A(t,n)$ denote the number of antichains of this poset. The quantity $A(t,n)$ has a number of combinatorial…
The main goal of the paper is to provide a quantitative lower bound greater than $1$ for the relative projection constant $\lambda(Y, X)$, where $X$ is a subspace of $\ell_{2p}^m$ space and $Y \subset X$ is an arbitrary hyperplane. As a…
It is known that the Brownian bridge or L\'evy-Ciesielski construction of Brownian paths almost surely converges uniformly to the true Brownian path. In the present article the focus is on the uniform error. In particular, we show…
We study the sharp constant in the Morrey inequality for fractional Sobolev-Slobodecki\u{\i} spaces on the whole $\mathbb{R}^N$. By generalizing a recent work by Hynd and Seuffert, we prove existence of extremals, together with some…
We present a unified approach to improved $L^p$ Hardy inequalities in $\R^N$. We consider Hardy potentials that involve either the distance from a point, or the distance from the boundary, or even the intermediate case where distance is…
Alexandrov's inequalities imply that for any convex body $A$, the sequence of intrinsic volumes $V_1(A),\ldots,V_n(A)$ is non-increasing (when suitably normalized). Milman's random version of Dvoretzky's theorem shows that a large initial…
We prove that the convergence of the real and imaginary parts of the logarithm of the characteristic polynomial of unitary Brownian motion toward Gaussian free fields on the cylinder, as the matrix dimension goes to infinity, holds in…
We improve known upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and non-periodic settings. Some of our bounds are sharp up to logarithmic factors.
We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
Consider the Poincar\'e-Sobolev inequality on the hyperbolic space: for every $n \geq 3$ and $1 < p \leq \frac{n+2}{n-2},$ there exists a best constant $S_{n,p, \lambda}(\mathbb{B}^{n})>0$ such that $$S_{n, p,…
We obtain the sharp constant for the Hardy-Sobolev inequality involving the distance to the origin. This inequality is equivalent to a limiting Caffarelli-Kohn-Nirenberg inequality. In three dimensions, in certain cases the sharp constant…
We show that a uniform quadrangulation, its largest 2-connected block, and its largest simple block jointly converge to the same Brownian map in distribution for the Gromov-Hausdorff-Prokhorov topology. We start by deriving a local limit…
We consider a finite or countable collection of one-dimensional Brownian particles whose dynamics at any point in time is determined by their rank in the entire particle system. Using Transportation Cost Inequalities for stochastic…