Related papers: Inscribing a regular crosspolytope

We show how inscription problems in the plane can be generalized to Riemannian surfaces of constant curvature. We then use ideas from symplectic and Riemannian geometry to prove these generalized versions for smooth Jordan curves in the…

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…

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

We construct a large family of neighborly polytopes that can be realized with all the vertices on the boundary of any smooth strictly convex body. In particular, we show that there are superexponentially many combinatorially distinct…

Convex polytopes are convex hulls of point sets in the $n$-dimensional space $\E^n$ that generalize 2-dimensional convex polygons and 3-dimensional convex polyhedra. We concentrate on the class of $n$-dimensional polytopes in $\E^n$ called…

An infinitely smooth symmetric convex body $K\subset\mathbb R^d$ is called $k$-separably integrable, $1\leq k<d$, if its $k$-dimensional isotropic volume function $V_{K,H}(t)=\mathcal H^d(\{\boldsymbol x\in K:\mathrm{dist}(\boldsymbol…

The Midscribability Theorem, which was first proved by O. Schramm, states that: given a strictly convex body $K\subset\mathbb{R}^{3}$ with smooth boundary and a convex polyhedron $P$, there exists a polyhedron $Q \subset \mathbb{RP}^3$…

We study convex polyhedra in $\mathbb{R}\mathbb{P}^3$ with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be…

In 3-dimensional Euclidean space there exist two exceptional polyhedra, the rhombic dodecahedron and the rhombic triacontahedron, the only known polytopes (besides polygons) that are edge-transitive without being vertex-transitive. We show…

In this paper we prove in certain n-dimensional normed spaces X the existence of full-dimensional equilateral simplices of large size inscribed to the unit ball B. This extends the construction of Makeev [Mak] in dimension 4 and we also…

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration…

In this work we prove constructively that the complement $\R^n\setminus\pol$ of a convex polyhedron $\pol\subset\R^n$ and the complement $\R^n\setminus\Int(\pol)$ of its interior are regular images of $\R^n$. If $\pol$ is moreover bounded,…

In 1997 Oda conjectured that every smooth lattice polytope has the integer decomposition property. We prove Oda's conjecture for centrally symmetric $3$-dimensional polytopes, by showing they are covered by lattice parallelepipeds and…

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested…

We show that nonlinear optimization techniques can successfully be applied to realize and to inscribe matroid polytopes and simplicial spheres. Thus we obtain a complete classification of neighborly polytopes of dimension $4$, $6$ and $7$…

This paper proves the following statement: If a convex body can form a fivefold translative tiling in $\mathbb{E}^3$, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron, an elongated dodecahedron, a truncated octahedron,…

A polynomial representation of a convex d-polytope P is a finite set \{p_1(x),...,p_n(x)\} of polynomials over E^d such that P=\setcond{x \in \E^d}{p_1(x) \ge 0 {for every} 1 \le i \le n}. By s(d,P) we denote the least possible number of…