118 citations · 220 across the 30 of their papers we have counts for
12 papers · 1 filter
Flat simplices and kissing polytopes
Antoine Deza, Lionel Pournin
We consider how flat a lattice simplex contained in the hypercube can be. This question is related to the notion of kissing polytopes: two lattice polytopes contained in…
Kissing polytopes in dimension 3
Antoine Deza, Zhongyuan Liu, Lionel Pournin
It is shown that the smallest possible distance between two disjoint lattice polytopes contained in the cube is exactly for…
Deep sections of the hypercube
Lionel Pournin
Consider a non-negative number and a hyperplane of whose distance to the center of the hypercube is . If is equal to and is orthogon…
Many equiprojective polytopes
Théophile Buffière, Lionel Pournin
A -dimensional polytope is -equiprojective when the projection of along any line that is not parallel to a facet of is a polygon with vertices. In 1968, Geoff…
Kissing polytopes
Antoine Deza, Shmuel Onn, Sebastian Pokutta +1
We investigate the following question: how close can two disjoint lattice polytopes contained in a fixed hypercube be? This question stems from various contexts where the minimal d…
Local extrema for hypercube sections
Lionel Pournin
Consider the hyperplanes at a fixed distance from the center of the hypercube . Significant attention has been given to determining the hyperplanes among these suc…
Shallow sections of the hypercube
Lionel Pournin
Consider a -dimensional closed ball whose center coincides with that of the hypercube . Pick the radius of in such a way that the vertices of the hypercube are…
Polytopal balls arising in optimization
Antoine Deza, Jean-Baptiste Hiriart-Urruty, Lionel Pournin
We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercu…
Elementary moves on lattice polytopes
Julien David, Lionel Pournin, Rado Rakotonarivo
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the -dimensional polytopes contained in and its edges connect any two polyto…
Diameter, decomposability, and Minkowski sums of polytopes
Antoine Deza, Lionel Pournin
We investigate how the Minkowski sum of two polytopes affects their graph and, in particular, their diameter. We show that the diameter of the Minkowski sum is bounded below by the…
Improved bounds on the diameter of lattice polytopes
Antoine Deza, Lionel Pournin
We show that the largest possible diameter of a -dimensional polytope whose vertices have integer coordinates ranging between and is at most $kd-\lceil2d/3\rcei…
The flip-graph of the 4-dimensional cube is connected
Lionel Pournin
Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92 487 256 triangulations, partitio…