Minimally distant sets of lattice points
In this paper, authors consider the problem of finding two sets of given cardinalities \(x\) and \(y\) in certain grid graphs, to minimize the maximum distance between two nodes respectively in the two sets. This minimax distance is denoted by \(D(x,y)\). For grids that are a product of chains of even edge length, and for the \(n\)-cube, the problem is solved completely. The answer in these cases is that both sets are initial segments of some ordering of vertices. An open question proposed in the end of this paper is as follows: For which chain products do orderings of the vertices exist such that initial segments minimize \(D(x,x)\), for all \(x\)?
- On the points at different distances from all lattice points
- scientific article; zbMATH DE number 4210154
- Lattices with few distances
- The minimum distance of sets of points and the minimum socle degree
- scientific article; zbMATH DE number 3995785
- scientific article; zbMATH DE number 3887673
- scientific article; zbMATH DE number 17647
- Lattice points in Minkowski sums
- Finite point-sets on S 2 with minimum distance as large as possible
- On distance sets in the triangular lattice
This page was built for publication: Minimally distant sets of lattice points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260773)
