Constructions of Large m-Distance Sets on Triangular Lattice

Abstract

An $m$-distance set is a collection of points such that the distances between any two points have $m$ possible values. We use two different methods to construct large $m$-distance sets on the triangular lattices. One is to use the first m smallest distances and find the largest cliques, and the other is using the notions of hexagons. Multiplicities of the distances were observed for comparison for the two methods.

19 pages, 34 figures