English

Homometry and direct-sum decompositions of lattice-convex sets

Metric Geometry 2016-05-13 v2 Combinatorics

Abstract

Two sets in Rd\mathbb{R}^d are called homometric if they have the same covariogram, where the covariogram of a finite subset KK of Rd\mathbb{R}^d is the function associating to each uRdu \in \mathbb{R}^d the cardinality of K(K+u)K \cap (K+u). Understanding the structure of homometric sets is important for a number of areas of mathematics and applications. If two sets are homometric but do not coincide up to translations and point reflections, we call them nontrivially homometric. We study nontrivially homometric pairs of lattice-convex sets, where a set KK is called lattice-convex with respect to a lattice MRd\mathbb{M} \subseteq \mathbb{R}^d if KK is the intersection of M\mathbb{M} and a convex subset of Rd\mathbb{R}^d. This line of research was initiated in 2005 by Daurat, G\'erard and Nivat and, independently, by Gardner, Gronchi and Zong. All pairs of nontrivially homometric lattice-convex sets that have been known so far can essentially be written as direct sums STS \oplus T and S(T)S \oplus (-T), where TT is lattice-convex, the underlying lattice~M\mathbb{M} is the direct sum of TT and some sublattice L\mathbb{L}, and SS is a subset of L\mathbb{L}. We study pairs of nontrivially homometric lattice-convex sets assuming this particular form and establish a necessary and a sufficient condition for the lattice-convexity of STS \oplus T. This allows us to explicitly describe all nontrivially homometric pairs in dimension two, under the above assumption, and to construct examples of nontrivially homometric pairs of lattice-convex sets for each d3d \ge 3.

Keywords

Cite

@article{arxiv.1412.7676,
  title  = {Homometry and direct-sum decompositions of lattice-convex sets},
  author = {Gennadiy Averkov and Barbara Langfeld},
  journal= {arXiv preprint arXiv:1412.7676},
  year   = {2016}
}

Comments

30 pages,8 figures, Magma code