English
Related papers

Related papers: The asymptotic diameter of cyclohedra

200 papers

A subset of the finite dimensional hypercube is said to be equilateral if the distance of any two distinct points equals a fixed value. The equilateral dimension of the hypercube is defined as the maximal size of its equilateral subsets. We…

Discrete Mathematics · Computer Science 2016-03-03 Lorenz Minder , Thomas Sauerwald , Sven-Ake Wegner

For a compact right-angled polyhedron $R$ in $\mathbb H^3$ denote by $\operatorname{vol} (R)$ the volume and by $\operatorname{vert} (R)$ the number of vertices. Upper and lower bounds for $\operatorname{vol} (R)$ in terms of…

Geometric Topology · Mathematics 2011-04-19 Dušan Repovš , Andrei Vesnin

A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if there exists a sphere tangent to all its edges. We derive…

Metric Geometry · Mathematics 2026-01-14 Sergey Korotov , Michal Krizek

As was pointed out by Nikulin [8] and Vinberg [10], a right-angled polyhedron of finite volume in hyperbolic n-space $\mathbb{H}^n$ has at least one cusp for $n\geq 5$. We obtain non-trivial lower bounds on the number of cusps of such…

Differential Geometry · Mathematics 2014-12-23 Jun Nonaka

We find an upper bound for the asymptotic dimension of a hyperbolic metric space with a set of geodesics satisfying a certain boundedness condition studied by Bowditch. The primary example is a collection of tight geodesics on the curve…

Geometric Topology · Mathematics 2014-02-26 Gregory Bell , Koji Fujiwara

Let $O$ be a closed $n$-dimensional arithmetic (real or complex) hyperbolic orbifold. We show that the diameter of $O$ is bounded above by $$\frac{c_1\log vol(O) + c_2}{h(O)},$$ where $h(O)$ is the Cheeger constant of $O$, $vol(O)$ is its…

Metric Geometry · Mathematics 2021-02-25 Mikhail Belolipetsky

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

Computational Geometry · Computer Science 2025-10-16 Boris Aronov , Sang Won Bae , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer , Raimund Seidel

We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…

Combinatorics · Mathematics 2021-12-03 James East , Michael Hendriksen , Laurence Park

Let $\Delta(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $\Delta(d,n)$ established by Kalai and Kleitman in 1992. This yields…

Optimization and Control · Mathematics 2016-04-18 Shinji Mizuno , Noriyoshi Sukegawa

Fix $d \ge 3$. We show the existence of a constant $c>0$ such that any graph of diameter at most $d$ has average distance at most $d-c \frac{d^{3/2}}{\sqrt n}$, where $n$ is the number of vertices. Moreover, we exhibit graphs certifying…

Combinatorics · Mathematics 2020-06-18 Stijn Cambie

It has been shown that the edge structure of the characteristic imset polytope is closely connected to the question of causal discovery. The diameter of a polytope is an indicator of how connected the polytope is and moreover gives us a…

Combinatorics · Mathematics 2023-03-07 Petter Restadh

An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to \pi/n for some fixed integer n at least 2. It is a consequence of Andreev's theorem that either n=3 and the polyhedron has all…

Geometric Topology · Mathematics 2014-10-01 Christopher K. Atkinson

Atkinson [2] found a sequence of three-dimensional hyperbolic polyhedra whose dihedral angles are $\pi /3$. In this paper, we construct another sequence of such polyhedra. We also determine the volumes of some of these polyhedra.

Geometric Topology · Mathematics 2024-05-29 Jun Nonaka

From the point of view of optimization, a critical issue is relating the combinatorial diameter of a polyhedron to its number of facets $f$ and dimension $d$. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper…

Combinatorics · Mathematics 2018-04-19 Steffen Borgwardt , Tamon Stephen , Timothy Yusun

We study the asymptotic behavior of the diameter or maximum interpoint distance of a cloud of i.i.d. $d$-dimensional random vectors when the number of points in the cloud tends to infinity. This is a non standard extreme value problem since…

Probability · Mathematics 2017-11-30 Yann Demichel , Ana Karina Fermin , Philippe Soulier

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

Metric Geometry · Mathematics 2007-05-23 Konrad J Swanepoel

We show there is an upper bound on the diameter of a closed, hyperbolic 3-manifold in terms of the length of any presentation of its fundamental group.

Geometric Topology · Mathematics 2007-05-23 Matthew E. White

We consider asymptotic dimension of coarse spaces. We analyse coarse structures induced by metrisable compactifications. We calculate asymptotic dimension of coarse cell complexes. We calculate the asymptotic dimension of certain negatively…

Metric Geometry · Mathematics 2007-05-23 Bernd Grave

In this paper we deal with the problem to find the maximal volume polyhedra with a prescribed property and inscribed in the unit sphere. We generalize those inequality (called by \emph{icosahedron inequality}) of L. Fejes-T\'oth of which an…

Metric Geometry · Mathematics 2014-11-24 Ákos G. Horváth

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We…

Metric Geometry · Mathematics 2019-10-28 Jin-ichi Itoh , Costin Vîlcu , Liping Yuan , Tudor Zamfirescu