Computing the covering radius of a polytope with an application to lonely runners

09/25/2020
by   Jana Cslovjecsek, et al.
0

We are concerned with the computational problem of determining the covering radius of a rational polytope. This parameter is defined as the minimal dilation factor that is needed for the lattice translates of the correspondingly dilated polytope to cover the whole space. As our main result, we describe a new algorithm for this problem, which is simpler, more efficient and easier to implement than the only prior algorithm of Kannan (1992). Motivated by a variant of the famous Lonely Runner Conjecture, we use its geometric interpretation in terms of covering radii of zonotopes, and apply our algorithm to prove the first open case of three runners with individual starting points.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2018

There is no lattice tiling of Z^n by Lee spheres of radius 2 for n≥ 3

We prove the nonexistence of lattice tilings of Z^n by Lee spheres of ra...
research
05/09/2023

A Generalized Covering Algorithm for Chained Codes

The covering radius is a fundamental property of linear codes that chara...
research
08/09/2021

The covering radius of permutation designs

A notion of t-designs in the symmetric group on n letters was introduced...
research
02/24/2022

An Algorithm for Computing the Covering Radius of a Linear Code Based on Vilenkin-Chrestenson Transform

We present a generalization of Walsh-Hadamard transform that is suitable...
research
01/10/2013

A remark on covering

We discuss construction of coverings of the unit ball of a finite dimens...
research
04/03/2023

Reproducing the results for NICER observation of PSR J0030+0451

NASA's Neutron Star Interior Composition Explorer (NICER) observed X-ray...
research
02/14/2020

Covering of high-dimensional cubes and quantization

As the main problem, we consider covering of a d-dimensional cube by n b...

Please sign up or login with your details

Forgot password? Click here to reset