相关论文: Slicing Sets and Measures, and the Dimension of Ex…

The metric sketching problem is defined as follows. Given a metric on $n$ points, and $\epsilon>0$, we wish to produce a small size data structure (sketch) that, given any pair of point indices, recovers the distance between the points up…

We consider the problem of finding on a given Euclidean domain $\Omega$ of dimension $n \geq 3$ a complete conformally flat metric whose Schouten curvature $A$ satisfies some equation of the form $f(\lambda(-A)) = 1$. This generalizes a…

Lipschitz decomposition is a useful tool in the design of efficient algorithms involving metric spaces. While many bounds are known for different families of finite metrics, the optimal parameters for $n$-point subsets of $\ell_p$, for $p >…

We prove that a compact metric space (or more generally an analytic subset of a complete separable metric space) of Hausdorff dimension bigger than $k$ can be always mapped onto a $k$-dimensional cube by a Lipschitz map. We also show that…

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Given a connected set $\Omega_0 \subset \mathbb{R}^2$, define a sequence of sets $(\Omega_n)_{n=0}^{\infty}$ where $\Omega_{n+1}$ is the subset of $\Omega_n$ where the first eigenfunction of the (properly normalized) Neumann $p-$Laplacian $…

We prove the following variant of Marstrand's theorem about projections of cartesian products of sets: Consider the space $\Lambda_m=\set{(t,O), t\in\R, O\in SO(m)}$ with the natural measure and set…

In any setting in which observable properties have a quantitative flavour, it is natural to compare computational objects by way of \emph{metrics} rather than equivalences or partial orders. This holds, in particular, for probabilistic…

In the paper we are dealing with metric measure spaces of diameter at most one and of total measure one. Gromov introduced the sampling compactification of the set of these spaces. He asked whether the metric measure space invariants extend…

A resolving set for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The metric dimension of $\Gamma$ is the smallest size of…

We establish several optimal estimates for exceptional parameters in the projection of fractal measures: (1) For a parametric family of self-similar measures satisfying a transversality condition, the set of parameters leading to a…

For a fixed, compactly supported probability measure $\mu$ on the $d$-dimensional space $\mathbb{R}^d$, we consider the problem of minimizing the $p^{\mathrm{th}}$-power average distance functional over all compact, connected $\Sigma…

Special generic maps are higher dimensional versions of Morse functions with exactly two singular points, characterizing spheres topologically except 4-dimensional cases and 4-dimensional standard spheres. The class of such maps also…

We prove that, if $\Omega\subset \mathbb{R}^n$ is an open bounded starshaped domain of class $C^2$, the constancy over $\partial \Omega$ of the function $$\varphi(y) = \int_0^{\lambda(y)} \prod_{j=1}^{n-1}[1-t \kappa_j(y)]\, dt$$ implies…

In this paper we prove that the shape optimization problem $$\min\left\{\lambda_k(\Omega):\ \Omega\subset\R^d,\ \Omega\ \hbox{open},\ P(\Omega)=1,\ |\Omega|<+\infty\right\},$$ has a solution for any $k\in\N$ and dimension $d$. Moreover,…

An $\ell_p$ oblivious subspace embedding is a distribution over $r \times n$ matrices $\Pi$ such that for any fixed $n \times d$ matrix $A$, $$\Pr_{\Pi}[\textrm{for all }x, \ \|Ax\|_p \leq \|\Pi Ax\|_p \leq \kappa \|Ax\|_p] \geq 9/10,$$…

Let $\Omega$ be an open set in $\mathbb{R}^n$ with $C^1$-boundary and $\Sigma$ be the skeleton of $\Omega$, which consists of points where the distance function to $\partial\Omega$ is not differentiable. This paper characterizes the cut…

In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also…

For non-empty sets X we define notions of distance and pseudo metric with values in a partially ordered set that has a smallest element $\theta $. If $h_X$ is a distance in $X$ (respectively, a pseudo metric in $X$), then the pair $(X,h_X)$…

We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap $(\log n)^{\Omega(1)}$. This is achieved by exhibiting $n$-point metric spaces of negative type whose $L_1$…