English
Related papers

Related papers: Metric dimension reduction modulus for superlogari…

200 papers

Oblivious low-distortion subspace embeddings are a crucial building block for numerical linear algebra problems. We show for any real $p, 1 \leq p < \infty$, given a matrix $M \in \mathbb{R}^{n \times d}$ with $n \gg d$, with constant…

Data Structures and Algorithms · Computer Science 2014-03-19 David P. Woodruff , Qin Zhang

We give a new proof and a partial generalization of Jean Taylor's result [Ta] that says that Almgren almost-minimal sets of dimension 2 in $\R^3$ are locally $C^{1+\alpha}$-equivalent to minimal cones. The proof is rather elementary, but…

Classical Analysis and ODEs · Mathematics 2008-12-18 Guy David

Goemans showed that any $n$ points $x_1, \dotsc x_n$ in $d$-dimensions satisfying $\ell_2^2$ triangle inequalities can be embedded into $\ell_{1}$, with worst-case distortion at most $\sqrt{d}$. We extend this to the case when the points…

Data Structures and Algorithms · Computer Science 2015-12-15 Amit Deshpande , Prahladh Harsha , Rakesh Venkat

Low-distortional metric embeddings are a crucial component in the modern algorithmic toolkit. In an online metric embedding, points arrive sequentially and the goal is to embed them into a simple space irrevocably, while minimizing the…

Data Structures and Algorithms · Computer Science 2024-11-05 Sujoy Bhore , Arnold Filtser , Csaba D. Tóth

We study a class of design problems in solid mechanics, leading to a variation on the classical question of equi-dimensional embeddability of Riemannian manifolds. In this general new context, we derive a necessary and sufficient existence…

Analysis of PDEs · Mathematics 2016-04-13 Amit Acharya , Marta Lewicka , Mohammad Reza Pakzad

Let $X$ be a set of $n$ points of norm at most $1$ in the Euclidean space $R^k$, and suppose $\varepsilon>0$. An $\varepsilon$-distance sketch for $X$ is a data structure that, given any two points of $X$ enables one to recover the square…

Metric Geometry · Mathematics 2017-04-04 Noga Alon , Bo'az Klartag

We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every map $f$ there exists…

Data Structures and Algorithms · Computer Science 2018-11-09 Sepideh Mahabadi , Konstantin Makarychev , Yury Makarychev , Ilya Razenshteyn

Let $f:\Omega\to\IR^2$ be a mapping of finite distortion, where $\Omega\subset\IR^2 .$ Assume that the distortion function $K(x,f)$ satisfies $e^{K(\cdot, f)}\in L^p_{loc}(\Omega)$ for some $p>0.$ We establish optimal regularity and area…

Complex Variables · Mathematics 2009-02-12 Kari Astala , James Gill , Steffen Rohde , Eero Saksman

Metric dimension is a graph parameter that has been applied to robot navigation and finding low-dimensional vector embeddings. Throttling entails minimizing the sum of two available resources when solving certain graph problems. In this…

Combinatorics · Mathematics 2025-10-02 Boris Brimkov , Peter Diao , Jesse Geneson , Carolyn Reinhart , Shen-Fu Tsai , William Wang , Kyle Worley

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 >…

Computational Geometry · Computer Science 2026-02-23 Robert Krauthgamer , Nir Petruschka

The Lipschitz extension modulus $e(M)$ of a metric space $M$ is the infimum over $L\ge 1$ such that for any Banach space $Z$ and any $C\subset M$, any 1-Lipschitz function $f:C\to Z$ can be extended to an $L$-Lipschitz function $F:M\to Z$.…

Metric Geometry · Mathematics 2024-02-14 Assaf Naor

The relation between different notions measuring proximity to $\ell_1$ and distortability of a Banach space is studied. The main result states that a Banach space, whose all subspaces have Bourgain $\ell_1$ index greater than…

Functional Analysis · Mathematics 2008-03-14 Anna Maria Pelczar

Fix $p\in[1,\infty)$, $K\in(0,\infty)$ and a probability measure $\mu$. We prove that for every $n\in\mathbb{N}$, $\varepsilon\in(0,1)$ and $x_1,\ldots,x_n\in L_p(\mu)$ with $\big\| \max_{i\in\{1,\ldots,n\}} |x_i| \big\|_{L_p(\mu)} \leq K$,…

Metric Geometry · Mathematics 2022-03-10 Alexandros Eskenazis

Fix $p>2$. We prove that the Euclidean distortion of every $n$-point subset of $L_p$ is $p^3(\log n)^{\frac12+o(1)}$, thus, in particular, demonstrating that all $n$-point subsets of $L_p$ exhibit an asymptotic improvement over the $O(\log…

Functional Analysis · Mathematics 2026-03-24 Assaf Naor , Kevin Ren

Let M be a compact spin manifold with a smooth action of the n-torus. Connes and Landi constructed theta-deformations M_{theta} of M, parameterized by n by n real skew-symmetric matrices theta. The M_{theta}'s together with the canonical…

Operator Algebras · Mathematics 2007-05-23 Hanfeng Li

The problem of computing a bi-Lipschitz embedding of a graphical metric into the line with minimum distortion has received a lot of attention. The best-known approximation algorithm computes an embedding with distortion $O(c^2)$, where $c$…

Data Structures and Algorithms · Computer Science 2020-02-25 Karine Chubarian , Anastasios Sidiropoulos

The $k$-median and $k$-means clustering objectives are classic objectives for modeling clustering in a metric space. Given a set of points in a metric space, the goal of the $k$-median (resp. $k$-means) problem is to find $k$ representative…

Computational Geometry · Computer Science 2026-03-11 Vincent Cohen-Addad , Karthik C. S. , David Saulpic , Chris Schwiegelshohn

We study the metric entropy of the metric space $B_n$ of all n-dimensional Banach spaces (the so-called Banach-Mazur compactum) equipped with the Banach-Mazur (multiplicative) "distance" $d$. We are interested either in estimates…

Functional Analysis · Mathematics 2019-02-20 Gilles Pisier

In a seminal paper, Kannan and Lov\'asz (1988) considered a quantity $\mu_{KL}(\Lambda,K)$ which denotes the best volume-based lower bound on the covering radius $\mu(\Lambda,K)$ of a convex body $K$ with respect to a lattice $\Lambda$.…

Optimization and Control · Mathematics 2026-03-30 Victor Reis , Thomas Rothvoss

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

Discrete Mathematics · Computer Science 2010-03-03 Anastasios Zouzias