English
Related papers

Related papers: Embedding the diamond graph in $L_p$ and dimension…

200 papers

For any collection of graphs we find the minimal dimension d such that the product of these graphs is embeddable into the d-dimensional Euclidean space. In particular, we prove that the n-th powers of the Kuratowsky graphs are not…

Geometric Topology · Mathematics 2025-07-18 Mikhail Skopenkov

Let $V$ be an $n$-dimensional vector space ($4\le n <\infty$) and let ${\mathcal G}_{k}(V)$ be the Grassmannian formed by all $k$-dimensional subspaces of $V$. The corresponding Grassmann graph will be denoted by $\Gamma_{k}(V)$. We…

Combinatorics · Mathematics 2010-09-15 Mark Pankov

The dimension of a graph $G$ is the smallest $d$ for which its vertices can be embedded in $d$-dimensional Euclidean space in the sense that the distances between endpoints of edges equal $1$ (but there may be other unit distances).…

Combinatorics · Mathematics 2020-02-25 Nóra Frankl , Andrey Kupavskii , Konrad J. Swanepoel

Given $r \geq 3$, we prove that there exists $\lambda >0$ depending only on $r$ so that if $G$ is a metric graph of rank $r$ with metric entropy $1$, then there exists a proper subgraph $H$ of $G$ with metric entropy at least $\lambda$.…

Geometric Topology · Mathematics 2025-06-25 Tarik Aougab , Matt Clay , Tawfiq Hamed

A metric graph is a pair $(G,d)$, where $G$ is a graph and $d:E(G) \to\mathbb{R}_{\geq0}$ is a distance function. Let $p \in [1,\infty]$ be fixed. An isometric embedding of the metric graph $(G,d)$ in $\ell_p^k = (\mathbb{R}^k, d_p)$ is a…

Combinatorics · Mathematics 2020-10-06 Samuel Fiorini , Tony Huynh , Gwenaël Joret , Carole Muller

In this note, we consider the metric Ramsey problem for the normed spaces l_p. Namely, given some 1<=p<=infinity and alpha>=1, and an integer n, we ask for the largest m such that every n-point metric space contains an m-point subspace…

Metric Geometry · Mathematics 2007-05-23 Yair Bartal , Nathan Linial. Manor Mendel , Assaf Naor

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Probability · Mathematics 2020-11-09 Michael P. Casey

In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter…

Metric Geometry · Mathematics 2020-04-14 Florent P. Baudier , Pavlos Motakis , Thomas Schlumprecht , András Zsák

We show a distortion lower bound of $\Omega(\log(h)^{1/p})$ when embedding the countably branching hyperbolic tree of height $h$ into a Banach space with an equivalent norm satisfying Rolewicz property $(\beta)$ with modulus of power type…

Metric Geometry · Mathematics 2014-12-16 Florent Pierre Baudier

For every $p\in (0,\infty)$ we associate to every metric space $(X,d_X)$ a numerical invariant $\mathfrak{X}_p(X)\in [0,\infty]$ such that if $\mathfrak{X}_p(X)<\infty$ and a metric space $(Y,d_Y)$ admits a bi-Lipschitz embedding into $X$…

Functional Analysis · Mathematics 2016-01-01 Assaf Naor , Gideon Schechtman

Cohen-Addad, Le, Pilipczuk, and Pilipczuk [CLPP23] recently constructed a stochastic embedding with expected $1+\varepsilon$ distortion of $n$-vertex planar graphs (with polynomial aspect ratio) into graphs of treewidth…

Data Structures and Algorithms · Computer Science 2024-11-04 Hsien-Chih Chang , Vincent Cohen-Addad , Jonathan Conroy , Hung Le , Marcin Pilipczuk , Michał Pilipczuk

We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…

Metric Geometry · Mathematics 2007-05-23 Sanjeev Arora , James R. Lee , Assaf Naor

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the…

Combinatorics · Mathematics 2012-02-28 Francisco Santos , Tamon Stephen , Hugh Thomas

We prove that the $\frac12$-snowflake of a finite-dimensional normed space $(X,\|\cdot\|_X)$ embeds into a Hilbert space with quadratic average distortion $$O\Big(\sqrt{\log \mathrm{dim}(X)}\Big).$$ We deduce from this (optimal) statement…

Functional Analysis · Mathematics 2021-07-21 Assaf Naor

We show that every n-point tree metric admits a (1+eps)-embedding into a C(eps) log n-dimensional L_1 space, for every eps > 0, where C(eps) = O((1/eps)^4 log(1/eps)). This matches the natural volume lower bound up to a factor depending…

Metric Geometry · Mathematics 2011-09-07 James R. Lee , Arnaud de Mesmay , Mohammad Moharrami

The problem of providing complete presentations of reduction algebras associated to a pair of Lie algebras $(\mathfrak{G},\mathfrak{g})$ has previously been considered by Khoroshkin and Ogievetsky in the case of the diagonal reduction…

Representation Theory · Mathematics 2023-12-08 Jonas T. Hartwig , Dwight Anderson Williams

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

We prove that there exists an absolute constant $\alpha<1$ such that for every finite dimension $d$ and every quantum channel $T$ on $\mathsf{L}(\mathbb{C}^d)$, $\left\|\Theta\circ(\mathrm{id}-T)\right\|_\diamond \le…

Quantum Physics · Physics 2026-02-24 Hyunho Cha

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…

Functional Analysis · Mathematics 2017-10-24 Grigoris Paouris , Petros Valettas

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814…

Combinatorics · Mathematics 2011-04-18 Francisco Santos