English
Related papers

Related papers: Concurrent normals problem for convex polytopes an…

200 papers

We characterize the three-dimensional spaces admitting at least six or at least seven equidistant points. In particular, we show the existence of $C^\infty$ norms on $\R^3$ admitting six equidistant points, which refutes a conjecture of…

Metric Geometry · Mathematics 2007-05-23 Achill Schuermann , Konrad Swanepoel

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 illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

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

Metric Geometry · Mathematics 2007-05-23 Konstantin Rybnikov

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

We study upper bounds on the number of lattice points for convex bodies having their centroid at the origin. For the family of simplices as well as in the planar case we obtain best possible results. For arbitrary convex bodies we provide…

Metric Geometry · Mathematics 2015-05-26 Sören Lennart Berg , Martin Henk

We study the equilibrium positions of three points on a convex curve under influence of the Coulomb potential. We identify these positions as orthotripods, three points on the curve having concurrent normals. This relates the equilibrium…

Differential Geometry · Mathematics 2015-08-28 Giorgi Khimshiashvili , Gaiane Panina , Dirk Siersma

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number…

Geometric Topology · Mathematics 2010-06-18 Benjamin A. Burton

We consider the discrepancy of the integer lattice with respect to the collection of all translated copies of a dilated convex body having a finite number of flat, possibly non-smooth, points in its boundary. We estimate the $L^{p}$ norm of…

Functional Analysis · Mathematics 2018-10-02 Luca Brandolini , Leonardo Colzani , Bianca Gariboldi , Giacomo Gigante , Giancarlo Travaglini

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

Functional Analysis · Mathematics 2026-02-27 Han Huang , Mark Rudelson

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

Probability · Mathematics 2022-01-11 M. Reitzner , C. Schuett , E. M. Werner

The main goal of this paper is to provide an alternative proof of the following theorem of Petty: in the normed space of dimension at least three, every 3-element equilateral set can be extended to a 4-element equilateral set. Our approach…

Metric Geometry · Mathematics 2014-11-20 Tomasz Kobos

Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…

Functional Analysis · Mathematics 2019-09-10 Luca Brandolini , Giancarlo Travaglini

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

Complex Variables · Mathematics 2020-09-29 Purvi Gupta , Rasul Shafikov

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

Probability · Mathematics 2017-06-12 Nicola Turchi , Florian Wespi

We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…

Combinatorics · Mathematics 2007-05-23 Jeff Erickson

We define a 2-normal surface to be one which intersects every 3-simplex of a triangulated 3-manifold in normal triangles and quadrilaterals, with one or two exceptions. The possible exceptions are a pair of octagons, a pair of unknotted…

Geometric Topology · Mathematics 2009-09-29 David Bachman

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most $9$ lattice points on its boundary, where a polygon $P$ is called pseudointegral if the Ehrhart function of $P$ is a polynomial. We…

Combinatorics · Mathematics 2025-01-14 Tyrrell B. McAllister , Jason S. Williford