Related papers: Realizability and inscribability for simplicial po…
We augment the list of finite universal locally toroidal regular polytopes of type {3,3,4,3,3} due to P.McMullen and E.Schulte, adding as well as removing entries. This disproves a related long-standing conjecture. Our new universal…
For an integer $n\geq 7$, we investigate the matroid realization space of a specific deformation of the regular $n$-gon along with its lines of symmetry. It turns out that this particular realization space is birational to the elliptic…
All candidates to the weakly-irreducible not irreducible holonomy algebras of Lorentzian manifolds are known. In the present paper metrics that realize all these candidates as holonomy algebras are given. This completes the classification…
We construct four infinite families of chiral $3$-polytopes of type $\{4, 8\}$, with $1024m^4$, $2048m^4$, $4096m^4$ and $8192m^4$ automorphisms for every positive integer $m$, respectively. The automorphism groups of these polytopes are…
In this paper, we explore the geometry and the arithmetic of a family of polytopal sphere packings induced by regular polytopes in any dimension. We prove that every integral polytope is crystallographic, and we show that there are 11…
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…
We introduce sparse polynomial zonotopes, a new set representation for formal verification of hybrid systems. Sparse polynomial zonotopes can represent non-convex sets and are generalizations of zonotopes, polytopes, and Taylor models.…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…
The extension complexity of a polytope measures its amenability to succinct representations via lifts. There are several versions of extension complexity, including linear, real semidefinite, and complex semidefinite. We focus on the last…
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…
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a…
Can one build an arbitrary polytope from any polytope inside by iteratively stacking pyramids onto facets, without losing the convexity throughout the process? We prove that this is indeed possible for (i) 3-polytopes, (ii) 4-polytopes…
We classify edge-to-edge tilings of the sphere by congruent pentagons with the edge combination $a^4b$ and with rational angles in degree: they are a one-parameter family of symmetric $a^4b$-pentagonal subdivisions of the tetrahedron with…
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…
We provide a complete classification of six-dimensional symmetric toroidal orbifolds which yield N>=1 supersymmetry in 4D for the heterotic string. Our strategy is based on a classification of crystallographic space groups in six…
We construct 2^{\Omega(n^{5/4})} combinatorial types of triangulated 3-spheres on n vertices. Since by a result of Goodman and Pollack (1986) there are no more than 2^{O(n log n)} combinatorial types of simplicial 4-polytopes, this proves…
We present an efficient framework for solving algebraically-constrained global non-convex polynomial optimization problems over subsets of the hypercube. We prove the existence of an equivalent nonlinear reformulation of such problems that…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem.…
The enumeration of normal surfaces is a key bottleneck in computational three-dimensional topology. The underlying procedure is the enumeration of admissible vertices of a high-dimensional polytope, where admissibility is a powerful but…