Related papers: The largest small polytopes
The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…
We derive tight expressions for the maximum number of $k$-faces, $0\le k\le d-1$, of the Minkowski sum, $P_1+P_2+P_3$, of three $d$-dimensional convex polytopes $P_1$, $P_2$ and $P_3$, as a function of the number of vertices of the…
The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$
We study a problem of Santos about the largest possible diameter of a $d$-dimensional (abstract) simplicial complex on $n$ vertices. For dimension 2, we determine the exact value of the maximum for every $n$ using an explicit construction.…
We exhibit an $n$-node graph whose independent set polytope requires extended formulations of size exponential in $\Omega(n/\log n)$. Previously, no explicit examples of $n$-dimensional $0/1$-polytopes were known with extension complexity…
Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…
In this paper, we classify all the hyperbolic non-compact Coxeter polytopes of finite volume combinatorial type of which is either a pyramid over a product of two simplices or a product of two simplices of dimension greater than one.…
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…
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$…
In this paper, using the theory of matching polynomial of hypertrees and ordering of hypertrees, we determine the largest spectral radius of hypertrees with $m$ edges and given size of matching.
The Monotone Upper Bound Problem asks for the maximal number M(d,n) of vertices on a strictly-increasing edge-path on a simple d-polytope with n facets. More specifically, it asks whether the upper bound M(d,n)<=M_{ubt}(d,n) provided by…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
The "edge polytope" of a finite graph G is the convex hull of the columns of its vertex-edge incidence matrix. We study extremal problems for this class of polytopes. For k =2, 3, 5 we determine the maximum number of vertices of…
The combinatorial diameter of a polytope $P$ is the maximum value of a shortest path between two vertices of $P$, where the path uses the edges of $P$ only. In contrast to the combinatorial diameter, the circuit diameter of $P$ is defined…
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…
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…
The Hirsch conjecture was posed in 1957 in a letter from Warren M. Hirsch to George Dantzig. It states that the graph of a d-dimensional polytope with n facets cannot have diameter greater than n - d. Despite being one of the most…