English
Related papers

Related papers: Width of l^p balls

200 papers

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

Computational Geometry · Computer Science 2014-04-25 Quentin Mérigot

As has been known since the time of Gromov's Nonsqueezing Theorem, symplectic embedding questions lie at the heart of symplectic geometry. After surveying some of the most important ways of measuring the size of a symplectic set, these…

Symplectic Geometry · Mathematics 2009-10-14 Dusa McDuff

A metric space $M$ us said to have the fibered approximation property in dimension $n$ (br., $M\in \mathrm{FAP}(n)$) if for any $\epsilon>0$, $m\geq 0$ and any map $g: I^m\times I^n\to M$ there exists a map $g':I^m\times I^n\to M$ such that…

Geometric Topology · Mathematics 2011-08-23 Taras Banakh , Vesko Valov

We prove a Lipschitz-Volume rigidity theorem in Alexandrov geometry, that is, if a 1-Lipschitz map $f\colon X=\amalg X_\ell\to Y$ between Alexandrov spaces preserves volume, then it is a path isometry and an isometry when restricted to the…

Differential Geometry · Mathematics 2015-06-24 Nan Li

We relate the problem of best low-rank approximation in the spectral norm for a matrix $A$ to Kolmogorov $n$-widths and corresponding optimal spaces. We characterize all the optimal spaces for the image of the Euclidean unit ball under $A$…

Numerical Analysis · Mathematics 2021-05-25 Michael S. Floater , Carla Manni , Espen Sande , Hendrik Speleers

The collection of all $n$-point metric spaces of diameter $\le 1$ constitutes a polytope $\mathcal{M}_n \subset \mathbb{R}^{\binom{n}{2}}$, called the \emph{Metric Polytope}. In this paper, we consider the best approximations of…

Metric Geometry · Mathematics 2023-05-04 Raziel Gartsman , Nati Linial

In this paper we use min-max theory to study the existence free boundary minimal hypersurfaces (FBMHs) in compact manifolds with boundary $(M^{n+1}, \partial M, g)$, where $2\leq n\leq 6$. Under the assumption that $g$ is a local maximizer…

Differential Geometry · Mathematics 2020-12-03 Yucheng Tu

We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…

Metric Geometry · Mathematics 2016-12-30 Pavel Galashin , Vladimir Zolotov

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

Combinatorics · Mathematics 2019-11-12 Sascha Kurz , Reinhard Laue

In this article, we study the relation between Sobolev-type embeddings for Sobolev spaces or Besov spaces or Triebel-Lizorkin spaces defined either on a doubling or on a geodesic metric measure space and lower bound for measure of balls…

Functional Analysis · Mathematics 2018-03-26 Nijjwal Karak

The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…

Metric Geometry · Mathematics 2021-08-31 Fei Xue , Yanlu Lian , Jun Wang , Yuqin Zhang

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

Combinatorics · Mathematics 2007-11-14 Frank Vallentin

We present a self-contained proof that the number of diameter pairs among n points in Euclidean 3-space is at most 2n-2. The proof avoids the ball polytopes used in the original proofs by Grunbaum, Heppes and Straszewicz. As a corollary we…

Combinatorics · Mathematics 2008-05-13 Konrad J Swanepoel

Any closed, connected Riemannian manifold $M$ can be smoothly embedded by its Laplacian eigenfunction maps into $\mathbb{R}^m$ for some $m$. We call the smallest such $m$ the maximal embedding dimension of $M$. We show that the maximal…

Machine Learning · Statistics 2016-05-06 Jonathan Bates

In this paper, order estimates for the Kolmogorov $n$-widths of an intersection of an arbitrary family of balls $\nu_\alpha B^{\overline{k}}_{\overline{p}_\alpha}$ in $l_q^k$ are obtained for $1\le q\le 2$, $n\le \frac k2$. Here…

Functional Analysis · Mathematics 2025-01-13 A. A. Vasil'eva

A mapping $f:X\to Y$ between metric spaces is called \emph{little Lipschitz} if the quantity $$ \operatorname{lip}(f(x)=\liminf_{r\to0}\frac{\operatorname{diam} f(B(x,r))}{r} $$ is finite for every $x\in X$. We prove that if a compact (or,…

Classical Analysis and ODEs · Mathematics 2018-02-23 Jan Malý , Ondřej Zindulka

If $(M^n, g)$ is a closed Riemannian manifold where every unit ball has volume at most $\epsilon_n$ (a sufficiently small constant), then the $(n-1)$-dimensional Uryson width of $(M^n, g)$ is at most 1.

Differential Geometry · Mathematics 2015-04-30 Larry Guth

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

Metric Geometry · Mathematics 2007-05-23 Frank Morgan

We consider the problem of determining the manifold $n$-widths of Sobolev and Besov spaces with error measured in the $L_p$-norm. The manifold widths control how efficiently these spaces can be approximated by general non-linear parametric…

Numerical Analysis · Mathematics 2024-07-08 Jonathan W. Siegel

Suppose that we have the unit Euclidean ball in $\R^n$ and construct new bodies using three operations - linear transformations, closure in the radial metric and multiplicative summation defined by $\|x\|_{K+_0L} = \sqrt{\|x\|_K\|x\|_L}.$…

Functional Analysis · Mathematics 2007-05-23 N. J. Kalton , A. Koldobsky , V. Yaskin , M. Yaskina