English
Related papers

Related papers: On the Hadwiger covering problem in low dimensions

200 papers

A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…

Optimization and Control · Mathematics 2023-02-24 Christian Bingane

In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…

Metric Geometry · Mathematics 2021-05-10 Alexandre Delyon , Antoine Henrot , Yannick Privat

We settle the first unsolved case of a problem of P. M. Gruber, asked by him in 1991, namely, to investigate the homomorphisms from the lattice of convex bodies of ${\mathbb{E}}^c$ to the lattice of convex bodies of ${\mathbb{E}}^d$ for…

Metric Geometry · Mathematics 2015-01-23 Luisa Allgaier , Heinz Weisshaupt

In this paper, we prove the Bounded Height Conjecture which the author formulated in [2]. As a corollary, it follows that there are only a finite number of hyperbolic three manifolds of bounded volume and trace field degree.

Geometric Topology · Mathematics 2014-09-09 BoGwang Jeon

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Combinatorics · Mathematics 2026-05-28 Domonkos Czifra , Ákos Dúcz , Máté Matolcsi , Dániel Varga , Pál Zsámboki

Answering Tarski's plank problem, Bang showed in 1951 that it is impossible to cover a convex body $K \subset \mathbb{R}^d$ with $d \geq 1$ by planks whose total width is less than the minimal width $w(K)$ of $K$. In 2003, A. Bezdek asked…

Metric Geometry · Mathematics 2025-11-24 Gergely Ambrus , Julian Huddell , Maggie Lai , Matthew Quirk , Elias Williams

A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of…

Metric Geometry · Mathematics 2014-03-11 Kazuhiro Ichihara , Akira Ushijima

In this paper, we introduce an $m$-fold illumination number $I^m(K)$ of a convex body $K$ in Euclidean space $\mathbb{E}^d$, which is the smallest number of directions required to $m$-fold illuminate $K$, i.e., each point on the boundary of…

Metric Geometry · Mathematics 2023-06-26 Kirati Sriamorn

On a family of arithmetic hyperbolic 3-manifolds of squarefree level, we prove an upper bound for the sup-norm of Hecke-Maass cusp forms, with a power saving over the local geometric bound simultaneously in the Laplacian eigenvalue and the…

Number Theory · Mathematics 2016-05-31 Valentin Blomer , Gergely Harcos , Djordje Milićević

In ["Illumination of convex bodies with many symmetries", Mathematika 63 (2017)], Tikhomirov verified the Hadwiger-Boltyanski Illumination Conjecture for the class of 1-symmetric convex bodies of sufficiently large dimension. We propose an…

Metric Geometry · Mathematics 2024-07-16 Wen Rui Sun , Beatrice-Helen Vritsiou

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

The contact graph of a packing of translates of a convex body in Euclidean $d$-space $\mathbb E^d$ is the simple graph whose vertices are the members of the packing, and whose two vertices are connected by an edge if the two members touch…

Metric Geometry · Mathematics 2018-11-06 Károly Bezdek , Márton Naszódi

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

A generalization of pairwise intersecting Minkowski arrangement of centrally symmetric convex bodies is the pairwise intersecting Minkowski arrangement of order $\mu$. Here, the homothetic copies of a centrally symmetric convex body are so…

Metric Geometry · Mathematics 2020-02-20 Viktória Földvári

Let $\gamma^d_m(K)$ be the smallest positive number $\lambda$ such that the convex body $K$ can be covered by $m$ translates of $\lambda K$. Let $K^d$ be the $d$-dimensional crosspolytope. It will be proved that $\gamma^d_m(K^d)=1$ for…

Metric Geometry · Mathematics 2023-05-24 Antal Joós

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

Computational Geometry · Computer Science 2015-03-17 Jean Cardinal , Matias Korman

We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…

Numerical Analysis · Mathematics 2022-02-22 Michael Floater , Andrew Gillette , N. Sukumar

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

In this paper we obtain new upper bounds on volumes of right-angled polyhedra in hyperbolic space $\mathbb{H}^3$ in three different cases: for ideal polyhedra with all vertices on the ideal hyperbolic boundary, for compact polytopes with…

Geometric Topology · Mathematics 2022-01-06 Stepan Alexandrov , Nikolay Bogachev , Andrei Egorov , Andrei Vesnin

The problem of classifying high-dimensional shapes in real-world data grows in complexity as the dimension of the space increases. For the case of identifying convex shapes of different geometries, a new classification framework has…

Machine Learning · Computer Science 2022-03-01 Brian J. Weber , Sandesh S. Kalantre , Thomas McJunkin , Jacob M. Taylor , Justyna P. Zwolak
‹ Prev 1 4 5 6 7 8 10 Next ›