English
Related papers

Related papers: Floating body, illumination body, and polytopal ap…

200 papers

Asymptotic results for weighted floating bodies are established and used to obtain new proofs for the existence of floating areas on the sphere and in hyperbolic space and to establish the existence of floating areas in Hilbert geometries.…

Metric Geometry · Mathematics 2019-06-18 Florian Besau , Monika Ludwig , Elisabeth M. Werner

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

The section volume function $A_K(\xi,t), \ \xi \in \mathbb R^n, \ t \in \mathbb R,$ of a body $K \subset \mathbb R^n$ evaluates the $(n-1)$-dimensional volume of the cross-section $K$ by the hyperplane $\{ x \cdot \xi=t \}.$ We are…

Metric Geometry · Mathematics 2024-10-01 Mark Agranovsky

In 1921 Blichfeldt gave an upper bound on the number of integral points contained in a convex body in terms of the volume of the body. More precisely, he showed that $#(K\cap\Z^n)\leq n! \vol(K)+n$, whenever $K\subset\R^n$ is a convex body…

Metric Geometry · Mathematics 2007-05-23 Martin Henk , Joerg M. Wills

Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…

Metric Geometry · Mathematics 2013-07-22 Rade T. Živaljević

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

Probability · Mathematics 2020-09-22 Alan Frieze , Wesley Pegden , Tomasz Tkocz

The covariogram g_K(x) of a convex body K \subseteq E^d is the function which associates to each x \in E^d the volume of the intersection of K with K+x. Matheron asked whether g_K determines K, up to translations and reflections in a point.…

Metric Geometry · Mathematics 2007-05-23 Gennadiy Averkov , Gabriele Bianchi

We complete the classification of compact hyperbolic Coxeter $d$-polytopes with $d+4$ facets for $d=4$ and $5$. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is $d=6$. We derive a new…

Combinatorics · Mathematics 2022-10-17 Amanda Burcroff

We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…

Metric Geometry · Mathematics 2020-03-02 Florian Besau , Steven Hoehner , Gil Kur

The largest volume ratio of given convex body $K \subset \mathbb{R}^n$ is defined as $$\mbox{lvr}(K):= \sup_{L \subset \mathbb{R}^n} \mbox{vr}(K,L),$$ where the $\sup$ runs over all the convex bodies $L$. We prove the following sharp lower…

Metric Geometry · Mathematics 2020-04-21 Daniel Galicer , Mariano Merzbacher , Damián Pinasco

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

Combinatorics · Mathematics 2024-01-30 Joshua Hinman

An infinitely smooth symmetric convex body $K\subset\mathbb R^d$ is called $k$-separably integrable, $1\leq k<d$, if its $k$-dimensional isotropic volume function $V_{K,H}(t)=\mathcal H^d(\{\boldsymbol x\in K:\mathrm{dist}(\boldsymbol…

Metric Geometry · Mathematics 2023-06-30 Vladyslav Yaskin , Bartłomiej Zawalski

Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…

Metric Geometry · Mathematics 2013-08-06 Horst Martini , Christian Richter , Margarita Spirova

In this work we prove that if for a pair of convex bodies $K_1, K_2 \subset \mathbb{R}^n$, $n \geq 3$, there exists a hyperplane $H$ and two distinct points $p_1$ and $p_2$ in $\mathbb{R}^n \setminus H$ such that for every $(n-2)$-plane $M…

Metric Geometry · Mathematics 2026-02-03 Efren Morales-Amaya

The isotropic constant $L_K$ is an affine-invariant measure of the spread of a convex body $K$. For a $d$-dimensional convex body $K$, $L_K$ can be defined by $L_K^{2d} = \det(A(K))/(\mathrm{vol}(K))^2$, where $A(K)$ is the covariance…

Functional Analysis · Mathematics 2015-12-09 Luis Rademacher

Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional faces of Kn. We show that for planar convex sets, E(f0(Kn)) is increasing…

Computational Geometry · Computer Science 2012-11-30 Olivier Devillers , Marc Glisse , Xavier Goaoc , Guillaume Moroz , Matthias Reitzner

We prove that the reciprocal of the volume of the polar bodies, about the Santal\'o point, of a {\em shadow system} of convex bodies $K_t$, is a convex function of $t$. Thus extending to the non-symmetric case a result of Campi and Gronchi.…

Metric Geometry · Mathematics 2008-07-14 Mathieu Meyer , Shlomo Reisner

Choose $n$ random, independent points in $\R^d$ according to the standard normal distribution. Their convex hull $K_n$ is the {\sl Gaussian random polytope}. We prove that the volume and the number of faces of $K_n$ satisfy the central…

Combinatorics · Mathematics 2007-05-23 I. Barany , V. H. Vu

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

Combinatorics · Mathematics 2022-07-26 Guillermo Pineda-Villavicencio , David Yost

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1\oplus{}P_2$, of two $d$-dimensional convex polytopes $P_1$ and $P_2$, as a function of the number of vertices of the polytopes.…

Computational Geometry · Computer Science 2011-10-04 Menelaos I. Karavelas , Eleni Tzanaki
‹ Prev 1 3 4 5 6 7 10 Next ›