6 problems
Let an -distance set be a set of points whose pairwise distances take at most values. The multiplicity of a distance is the number of unordered pairs of points in the set re…
Let a triangular lattice be the set of points with coordinates , where . Consider a regular hexagon or an equiangular hexagon w…
Let a triangular lattice be the set of points with coordinates , where . An equiangular hexagon has six sides in the lattice di…
Let a triangular lattice be the set of points with coordinates , where . An -distance set is a set of lattice points whose p…
Let an -distance set be a collection of points in the Euclidean plane such that the distances between any two points take at most possible values. A triangular lattice is th…
Let be the triangular lattice. A -QPDS in has an associated hexagonal structure whose hexagons have types , , and . Mortar-and…