The reviewed record of science sign in
Pith

arxiv: 2305.18597 · v2 · pith:65DXIIJ5 · submitted 2023-05-29 · math.MG · math.CO· math.OC

Kissing polytopes

Antoine Deza , Shmuel Onn , Sebastian Pokutta , Lionel Pournin This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:65DXIIJ5record.jsonopen to challenge →

classification math.MG math.COmath.OC
keywords polytopesboundsdisjointdistancequestionalgorithmsappearsbinary
0
0 comments X
read the original abstract

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 distance between such polytopes appears in complexity bounds of optimization algorithms. We provide nearly matching lower and upper bounds on this distance and discuss its exact computation. We also give similar bounds in the case of disjoint rational polytopes whose binary encoding length is prescribed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.