On a Dispersion Problem in Grid Labeling

Abstract

Given k labelings of a finite d-dimensional grid, define the combined distance between two labels to be the sum of the ℓ 1 -distance between the two labels in each labeling. We present asymptotically optimal constructions of k labelings of cubical d-dimensional grids which maximize the minimum combined distance.