English
Related papers

Related papers: On universal covers for four-dimensional sets of a…

200 papers

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal…

Metric Geometry · Mathematics 2025-09-18 Keith Ball , Károly J. Böröczky , Assaf Naor

In this note, we prove that every open primary basic semialgebraic set is stably equivalent to the realization space of an even-dimensional neighborly polytope. This in particular provides the final step for Mn\"ev's proof of the…

Metric Geometry · Mathematics 2014-10-01 Karim A. Adiprasito , Arnau Padrol

We show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and…

Combinatorics · Mathematics 2007-05-23 Adam Bliss , Francis Edward Su

One unsolved mathematical problem remains the perfect cuboid problem. A perfect cuboid is a rectangular parallelepiped whose edges, face diagonals and space diagonal are all expressed as integers. No such cuboid has yet been discovered and…

Number Theory · Mathematics 2022-03-03 Natalia Aleshkevich

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

It has been shown by Soprunov that the normalized mixed volume (minus one) of an $n$-tuple of $n$-dimensional lattice polytopes is a lower bound for the number of interior lattice points in the Minkowski sum of the polytopes. He defined…

Combinatorics · Mathematics 2020-02-27 Gabriele Balletti , Christopher Borger

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

Computational Geometry · Computer Science 2021-08-03 Shai Gul , Reuven Cohen , Simi Haber

In this note we prove that for any compact subset $S$ of a Busemann surface $({\mathcal S},d)$ (in particular, for any simple polygon with geodesic metric) and any positive number $\delta$, the minimum number of closed balls of radius…

Metric Geometry · Mathematics 2017-03-10 Victor Chepoi , Bertrand Estellon , Guyslain Naves

We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…

Differential Geometry · Mathematics 2007-05-23 Benson Farb , Shmuel Weinberger

Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). In this paper, we present several direct bijective proofs…

Combinatorics · Mathematics 2012-08-16 Travis Hance , Nan Li

The hexabasic book is the cone of the 1-dimensional skeleton of the union of two tetrahedra glued along a common face. The universal 3-dimensional polyhedron UP is the product of a segment and the hexabasic book. We show that any…

Geometric Topology · Mathematics 2014-10-01 Cherry Kearton , Vitaliy Kurlin

We prove that the universal cover of any graph manifold quasi-isometrically embeds into a product of three trees. In particular we show that the Assouad-Nagata dimension of the universal cover of any closed graph manifold is 3, proving a…

Geometric Topology · Mathematics 2012-04-18 David Hume , Alessandro Sisto

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak

In 1996 Sabitov proved that the volume of an arbitrary simplicial polyhedron P in the 3-dimensional Euclidean space $\R^3$ satisfies a monic (with respect to V) polynomial relation F(V,l)=0, where l denotes the set of the squares of edge…

Metric Geometry · Mathematics 2024-11-20 Alexander A. Gaifullin

The chromatic number for properly colouring the facets of a combinatorial simple $n$-polytope $P^n$ that is the orbit space of a quasitoric manifold satisfies the inequality $n\leq P^n\leq 2^n-1$. The inequality is sharp for $n=2$ but not…

Combinatorics · Mathematics 2023-02-10 Djordje Baralic

Planar linkages are a rich area of study motivated by practical applications in engineering mechanisms. A central result is Kempe's Universality Theorem, which states that semi-algebraic sets can be realized by planar linkages. Polyhedral…

Combinatorics · Mathematics 2025-02-25 Robert Miranda

A family of subsets of $\{1,2,\ldots,n\}$ is said to be {\em antipodal} if it is closed under taking complements. We prove a best-possible isoperimetric inequality for antipodal families of subsets of $\{1,2,\ldots,n\}$. Our inequality…

Combinatorics · Mathematics 2017-11-15 David Ellis , Imre Leader

We study a one parameter family of cubic self-inversive polynomials that "envelope" conic sections in the following sense. Provided the three roots of the polynomial lie on the unit circle, when you draw the triangle connecting the roots,…

Complex Variables · Mathematics 2015-11-05 William Calbeck

Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…

Metric Geometry · Mathematics 2018-05-22 Ilya Dumer

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

Metric Geometry · Mathematics 2007-05-23 Greg Martin