English
Related papers

Related papers: Width of l^p balls

200 papers

It is known that any periodic map of order $n$ on a closed oriented surface of genus $g$ can be equivariantly embedded into $S^m$ for some $m$. In the orientable and smooth category, we determine the smallest possible $m$ when $n\geq 3g$.…

Geometric Topology · Mathematics 2024-08-27 Chao Wang , Shicheng Wang , Zhongzi Wang

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Information Theory · Computer Science 2017-11-10 Kasper Green Larsen , Jelani Nelson

We give a short proof of a theorem of Guth relating volume of balls and Uryson width. The same approach applies to Hausdorff content implying a recent result of Liokumovich-Lishak-Nabutovsky-Rotman. We show also that for any $C>0$ there is…

Differential Geometry · Mathematics 2020-02-18 Panos Papasoglu

Yudin's lower bound for the spherical designs is generalized to the cubature formulas on the projective spaces over a field K, where K can be R, C, or H (the field of quaternions), and thus to isometric embeddings of l_2 into l_p with p an…

Combinatorics · Mathematics 2007-05-23 Yuri Lyubich

We describe the set of parameters $(p_1,p_2,q_1,q_2)$ such that the balls $B_{q_1,q_2}^{s,b}$ are rigid in $\ell_{q_1,q_2}^{s,b}$ metric i.e. they are poorly approximated by linear subspaces of dimension $\le (1-\varepsilon)sb$, for large…

Functional Analysis · Mathematics 2025-02-28 Yuri Malykhin , Konstantin Ryutin

In this paper, isometric embedding results of Greene, Gromov and Rokhlin are extended to what are called "indefinite metric polyhedra". Two definitions for an indefinite metric polyhedron are given, an intuitive definition and a more useful…

Metric Geometry · Mathematics 2015-08-06 Barry Minemyer

The present paper aims to solve some problems proposed by Lassak about the reduced spherical polygons. The main result is to show that the regular spherical n-gon has the minimal perimeter among all reduced spherical polygons of fixed…

Metric Geometry · Mathematics 2022-04-14 Cen Liu , Yanxun Chang

We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if $A^*$ is the largest subset of diameter $r$ of $n$ points in the Euclidean…

Computational Geometry · Computer Science 2009-03-15 Peyman Afshani , Hamed Hatami

A nonuniform Neumann boundary-value problem is considered for the Poisson equation in a thin $3D$ aneurysm-type domain that consists of thin curvilinear cylinders that are joined through an aneurysm of diameter $\mathcal{O}(\varepsilon).$ A…

Analysis of PDEs · Mathematics 2020-01-07 A. V. Klevtsovskiy , T. A. Mel'nyk

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…

Computational Geometry · Computer Science 2016-11-30 Piotr Indyk , Tal Wagner

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

Let $\Lambda$ be the limit set of an infinite conformal iterated function system and let $F$ denote the set of fixed points of the maps. We prove that the box dimension of $\Lambda$ exists if and only if \[ \overline{\dim}_{\mathrm B} F\leq…

Dynamical Systems · Mathematics 2024-08-13 Amlan Banaji , Alex Rutar

For Euclidean space ($\ell_2$), there exists the powerful dimension reduction transform of Johnson and Lindenstrauss, with a host of known applications. Here, we consider the problem of dimension reduction for all $\ell_p$ spaces $1 \le p…

Computational Geometry · Computer Science 2015-12-08 Yair Bartal , Lee-Ad Gottlieb

We give upper and lower bounds for the ratio of the volume of metric ball to the area of the metric sphere in Finsler-Hadamard manifolds with pinched S-curvature. We apply these estimates to find the limit at the infinity for this ratio.…

Differential Geometry · Mathematics 2011-10-11 Alexandr A. Borisenko , Eugeny A. Olin

In this note, we give a characterization of immersed submanifolds of simply-connected space forms for which the quotient of the extrinsic diameter by the focal radius achieves the minimum possible value of $2$. They are essentially round…

Differential Geometry · Mathematics 2025-04-21 Ricardo A. E. Mendes

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

Computational Geometry · Computer Science 2009-09-29 Marc Glisse , Sylvain Lazard

We prove estimates for the optimal volume of thick embeddings of finite graphs into symmetric spaces, generalising results of Kolmogorov-Barzdin and Gromov-Guth for embeddings into Euclidean spaces. We distinguish two very different…

Geometric Topology · Mathematics 2023-12-13 Benjamin Barrett , David Hume , Larry Guth , Elia Portnoy

Examples show that Riemannian manifolds with almost-Euclidean lower bounds on scalar curvature and Perelman entropy need not be close to Euclidean space in any metric space sense. Here we show that if one additionally assumes an…

Differential Geometry · Mathematics 2022-11-09 Robin Neumayer

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

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