Related papers: Each generic polytope in $\mathbb{R}^3$ has a poin…

In a previous work we proved that each $n$-dimensional convex polyhedron ${\mathcal K}subset{\mathbb R}^n$ and its relative interior are regular images of ${\mathbb R}^n$. As the image of a non-constant polynomial map is an unbounded…

A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A…

We show that any compact smooth real $n$-dimensional manifold $M$ with $n\leq 11$ can be smoothly embedded into $\mathbb{C}^{n+1}$ as a polynomially convex set. In general, there is no such embedding into $\mathbb{C}^n$. This solves a…

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…

Let $G$ be a group and $g$ a non-trivial element in $G$. If some non-empty finite product of conjugates of $g$ equals to the trivial element, then $g$ is called a generalized torsion element. To the best of our knowledge, we have no…

A polytope in the hyperbolic space $\H^n$ is called an {\it ideal polytope} if all its vertices belong to the boundary of $\H^n$. We prove that no simple ideal Coxeter polytope exist in $\H^n$ for $n>8$.

Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…

A version of a conjecture of McMullen is as follows: Given a hyperbolizable 3-manifold M with incompressible boundary, there exists a uniform constant K such that if N is a hyperbolic 3-manifold homeomorphic to the interior of M, then the…

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

Given a set $S \subseteq \mathbb{R}^d$, a hollow polytope has vertices in $S$ but contains no other point of $S$ in its interior. We prove upper and lower bounds on the maximum number of vertices of hollow polytopes whose facets are…

A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

In his paper "On the Schlafli differential equality", J. Milnor conjectured that the volume of n-dimensional hyperbolic and spherical simplices, as a function of the dihedral angles, extends continuously to the closure of the space of…

We prove that every 4-polytope is determined by its edge-polygon incidences, solving an open problem of Gr\"unbaum. For each $d \geq 3$, we show that not every $d$-polytope is determined by its $(d-3)$-skeleton and dual $(d-3)$-skeleton…

Let $P\subset\mathbb{R}^n$ $(n\geq 3)$ be a convex polytope containing the origin in its interior. Let $\mbox{vol}_{n-2} \big( \mbox{relbd} ( P\cap\lbrace t\xi + \xi^\perp \rbrace ) \big)$ denote the $(n-2)$-dimensional volume of the…

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…

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a…