English
Related papers

Related papers: The width-volume inequality

200 papers

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

A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was…

Combinatorics · Mathematics 2024-10-30 Gabriela Araujo-Pardo , Martín Matamala , Juan P. Peña , José Zamora

We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…

Metric Geometry · Mathematics 2016-10-24 Kyle Kinneberg

It is a well-known fact -- which can be shown by elementary calculus -- that the volume of the unit ball in $\mathbb{R}^n$ decays to zero and simultaneously gets concentrated on the thin shell near the boundary sphere as $n \nearrow…

History and Overview · Mathematics 2026-02-24 Siran Li

It is shown that if $C$ is an $n$-dimensional convex body then there is an affine image $\widetilde C$ of $C$ for which $${|\partial \widetilde C|\over |\widetilde C|^{n-1\over n}}$$ is no larger than the corresponding expression for a…

Metric Geometry · Mathematics 2008-02-03 Keith Ball

This work focuses on the degree bound of maps between balls with maximum geometric rank and minimum target dimension where this geometric rank occurs. Specifically, we show that rational proper maps between $\mathbb{B}_n$ and $\mathbb{B}_N$…

Complex Variables · Mathematics 2024-10-22 Abdullah Al Helal

The P\'al inequality is a classical result which asserts that among all planar convex sets of given width the equilateral triangle is the one of minimal area. In this paper we prove three quantitative versions of this inequality, by…

Metric Geometry · Mathematics 2025-03-17 Ilaria Lucardesi , Davide Zucco

In this article, we study the (d-1)-volume and the covering numbers of the medial axis of a compact set of the Euclidean d-space. In general, this volume is infinite; however, the (d-1)-volume and covering numbers of a filtered medial axis…

Metric Geometry · Mathematics 2010-01-19 Quentin Merigot

There are two positive, absolute constants $c_{1}$ and $c_{2}$ so that the volume of the difference set of the $d$-dimensional Euclidean ball and an inscribed polytope with n vertices is larger than $$ c_{2}\ d\…

Metric Geometry · Mathematics 2008-02-03 Yehoram Gordon , Shlomo Reisner , Carsten Schütt

Given a set S of n points in R^D, and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n / (k+1)) can be computed in time O(n log n). For any…

Computational Geometry · Computer Science 2009-12-07 Boris Aronov , Mark de Berg , Otfried Cheong , Joachim Gudmundsson , Herman Haverkort , Michiel Smid , Antoine Vigneron

Let $1\leq i \leq k < n$ be integers. We prove the following exact inequalities for any convex body $K\subset\mathbb{R}^n$ with centroid at the origin, and any $k$-dimensional subspace $E\subset \mathbb{R}^n$: \begin{align*} &V_i \big(…

Metric Geometry · Mathematics 2018-09-18 Matthew Stephen , Vladyslav Yaskin

We present a complete system of inequalities for the inradius, circumradius, and diameter in the $3$-dimensional Euclidean space. To do so, we prove quasiconcavity of the inradius evaluated over $n$-simplices with a common facet…

Metric Geometry · Mathematics 2025-09-08 René Brandenberg , Bernardo González Merino , Mia Runge

We investigate lower asymptotic bounds of number variances for invariant locally square-integrable random measures on Euclidean and real hyperbolic spaces. In the Euclidean case we show that there are subsequences of radii for which the…

Probability · Mathematics 2024-05-22 Michael Björklund , Mattias Byléhn

Given a matrix $A \in \mathbb{R}^{m \times n}$ ($n$ vectors in $m$ dimensions), and a positive integer $k < n$, we consider the problem of selecting $k$ column vectors from $A$ such that the volume of the parallelepiped they define is…

Computational Complexity · Computer Science 2011-10-13 Ali Civril , Malik Magdon-Ismail

We consider the variational problem of minimizing an anisotropic perimeter functional under a volume constraint in a Euclidean convex domain. We extend to this setting analytical properties of the isoperimetric profile, topological features…

Differential Geometry · Mathematics 2025-04-14 César Rosales

An equilateral dimension of a normed space is a maximal number of pairwise equidistant points of this space. The aim of this paper is to study the equilateral dimension of certain classes of finite dimensional normed spaces. The well-known…

Metric Geometry · Mathematics 2014-11-20 Tomasz Kobos

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

For every convex body $K \subset \mathbb R^n$ and $\delta \in (0,1)$, the $\delta$-convolution body of $K$ is the set of $x \in \mathbb R^n$ for which $\left|K \cap (K+x)\right|_n \geq \delta \left|K\right|_n$. We show that for $n=2$ and…

Metric Geometry · Mathematics 2024-10-22 J. Haddad

In this article, we address the problem of determining a domain in $\mathbb{R}^N$ that minimizes the first eigenvalue of the Lam\'e system under a volume constraint. We begin by establishing the existence of such an optimal domain within…

Analysis of PDEs · Mathematics 2024-12-18 Antoine Henrot , Antoine Lemenant , Yannick Privat

A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…

Combinatorics · Mathematics 2026-03-23 Panna Gehér , Dömötör Pálvölgyi , Dániel G. Simon , Géza Tóth
‹ Prev 1 3 4 5 6 7 10 Next ›