Related papers: Bi-Lipschitz Bijection between the Boolean Cube an…
We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…
We prove that for any $2<p<\infty$ and for every $n$-dimensional subspace $X$ of $L_p$, represented on $\mathbb R^n$, whose unit ball $B_X$ is in Lewis' position one has the following two-level Gaussian concentration inequality: \[ \mathbb…
We give direct bijective proofs of the symmetry of the distributions of the number of ascents and descents over standard Young tableaux of shape $\lambda$, where $\lambda$ is a rectangle $(n,n,\dots,n)$ or a truncated staircase…
The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures.…
We consider the problem of determining a polyhedral conductivity inclusion embedded in a homogeneous isotropic medium from boundary measurements. We prove global Lipschitz stability for the polyhedral inclusion from the local…
A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. In this paper we show that every quasiconformal tree bi-Lipschitz embeds in some…
We show that there exists a strong uniform embedding from any proper metric space into any Banach space without cotype. Then we prove a result concerning the Lipschitz embedding of locally finite subsets of $\mathcal{L}_{p}$-spaces. We use…
In 1960 Reifenberg proved the topological disc property. He showed that a subset of $R^n$ which is well approximated by $m$-dimensional affine spaces at each point and at each (small) scale is locally a bi-H\"older image of the unit ball in…
Let $M$ be a compact Riemannian manifold with boundary. We show that $M$ is Gromov-Hausdorff close to a convex Euclidean region $D$ of the same dimension if the boundary distance function of $M$ is $C^1$-close to that of $D$. More…
Consider the quotient of a Hilbert space by a subgroup of its automorphisms. We study whether this orbit space can be embedded into a Hilbert space by a bilipschitz map, and we identify constraints on such embeddings.
We construct bypass attachments in higher dimensional contact manifolds that, when attached to a neighborhood of a Weinstein hypersurface, yield a neighborhood of a new Weinstein hypersurface, obtained via local modifications to the…
The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…
We prove that the Hilbert geometry of a convex domain in ${\mathbb R}^n$ has bounded local geometry, i.e., for a given radius, all balls are bilipschitz to a euclidean domain of ${\mathbb R}^n$. As a consequence, if the Hilbert geometry is…
We prove that isomorphism classes of principal bundles over a diffeological space are in bijection to certain maps on its free loop space, both in a setup with and without connections on the bundles. The maps on the loop space are smooth…
We present a link between billiards in convex plane domains and Hofer's geometry, an area of symplectic topology. For smooth strictly convex billiard tables, we prove that the Hofer distance between the corresponding billiard ball maps…
We consider the Reeb graph of a thickening of points sampled from an unknown space. Our main contribution is a framework to transfer reconstruction results similar to the well-known work of Niyogi, Smale, and Weinberger to the setting of…
We give sufficient conditions for a metric space to bilipschitz embed in L_1. In particular, if X is a length space and there is a Lipschitz map u:X--->R such that for every interval I in R, the connected components of the inverse image…
This paper develops upper and lower bounds for the probability of Boolean functions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. We call this approach dissociation and give an…
The probabilistic bisection algorithm (PBA) solves a class of stochastic root-finding problems in one dimension by successively updating a prior belief on the location of the root based on noisy responses to queries at chosen points. The…
We study null homotopies of immersed spheres in $\mathbb{R}^3$ and the volume they sweep during contraction. For a smooth immersion with finitely many transverse self-intersections, we introduce a cable system that connects each bounded…