English
Related papers

Related papers: From the Kneser-Poulsen conjecture to ball-polyhed…

200 papers

We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…

Information Theory · Computer Science 2014-10-24 Adityanand Guntuboyina

We consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

Functional Analysis · Mathematics 2017-08-07 Sergij V. Goncharov

We study the supremum of the volume of hyperbolic polyhedra with some fixed combinatorics and with vertices of any kind (real, ideal or hyperideal). We find that the supremum is always equal to the volume of the rectification of the…

Geometric Topology · Mathematics 2020-02-10 Giulio Belletti

The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr.~on the reverse question: Every convex body has a linear image whose…

Metric Geometry · Mathematics 2020-04-29 Bernardo González Merino , Matthias Schymura

In this paper we get an explicit lower bound for the radius of a Bergman ball contained in the Dirichlet fundamental polyhedron of a torsion-free discrete group $G\subset PU(n,1)$ acting on complex hyperbolic space. Consequently the volume…

Differential Geometry · Mathematics 2013-04-09 Baohua Xie , Jieyan Wang , Yueping Jiang

One of the most important problems in Geometric Tomography is to establish properties of a given convex body if we know some properties over its sections or its projections. There are many interesting and deep results that provide…

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun , Richard Ehrenborg

In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…

Optimization and Control · Mathematics 2012-01-04 Boris S. Mordukhovich , Nguyen Mau Nam , Cristina Villalobos

We study spherical completeness of ball spaces and its stability under expansions. We introduce the notion of an ultra-diameter, mimicking diameters in ultrametric spaces. We prove some positive results on preservation of spherical…

Logic · Mathematics 2021-08-25 Wieslaw Kubiś , Franz-Viktor Kuhlmann

The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…

Metric Geometry · Mathematics 2022-06-22 Bushra Basit , Zsolt Langi

The cognitive framework of conceptual spaces [3] provides geometric means for representing knowledge. A conceptual space is a high-dimensional space whose dimensions are partitioned into so-called domains. Within each domain, the Euclidean…

Artificial Intelligence · Computer Science 2017-09-25 Lucas Bechberger

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

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

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

Eggleston (1957) proved that in the Euclidean plane the best approximating convex $n$-gon to a convex disc $K$ is always inscribed in $K$ if we measure the distance by perimeter deviation. We prove that the analogue of Eggleston's statement…

Metric Geometry · Mathematics 2026-04-13 Ferenc Fodor

This article sketches the proofs of two theorems about sphere packings in Euclidean 3-space. The first is K. Bezdek's strong dodecahedral conjecture: the surface area of every bounded Voronoi cell in a packing of balls of radius 1 is at…

Metric Geometry · Mathematics 2012-11-20 Thomas C. Hales

We consider the $N$-body problem of celestial mechanics in spaces of nonzero constant curvature. Using the concept of locked inertia tensor, we compute the moment of inertia for systems moving on spheres and hyperbolic spheres and show that…

Dynamical Systems · Mathematics 2016-03-11 Florin Diacu , Cristina Stoica , Shuqiang Zhu

Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of $n$ points in strictly convex normed planes can be constructed in $O(n \log n)$ time. In addition, we confirm that,…

Metric Geometry · Mathematics 2014-11-28 Pedro Martín , Horst Martini

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Computational Complexity · Computer Science 2023-11-16 Anindya De , Shivam Nadimpalli , Rocco A. Servedio