English

Isomorphisms of unit distance graphs of layers

Combinatorics 2025-05-26 v3 Discrete Mathematics

Abstract

For any ε(0,+)\varepsilon \in (0,+\infty), consider the metric spaces R×[0,ε]\mathbb{R} \times [0,\varepsilon] in the Euclidean plane named layers or strips. B. Baslaugh in 1998 found the minimal width ε(0,1)\varepsilon \in (0,1) of a layer such that its unit distance graph contains a cycle of a given odd length kk. The first of the main results of this paper is the fact that the unit distance graphs of two layers R×[0,ε1],R×[0,ε2]\mathbb{R} \times [0,\varepsilon_1], \mathbb{R} \times [0,\varepsilon_2] are non-isomorphic for any different values ε1,ε2(0,+)\varepsilon_1,\varepsilon_2 \in (0,+\infty). We also get a multidimensional analogue of this theorem. For given n,mN,p(1,+),ε(0,+)n,m \in \mathbb{N}, p \in (1,+\infty), \varepsilon \in (0,+\infty), we say that the metric space on Rn×[0,ε]m\mathbb{R}^n \times [0,\varepsilon]^m with the metric space distance generated by lpl_p-norm in Rn+m\mathbb{R}^{n+m} is a layer L(n,m,p,ε)L(n,m,p,\varepsilon). We show that the unit distance graphs of layers L(n,m,p,ε1),L(n,m,p,ε2)L(n,m,p,\varepsilon_1), L(n,m,p,\varepsilon_2) are non-isomorphic for ε1ε2\varepsilon_1 \neq \varepsilon_2. The third main result of this paper is the theorem that, for n2,ε>0n \geq 2, \varepsilon > 0, any automorphism ϕ\phi of the unit distance graph of layer L=L(n,1,2,ε)=Rn×[0,ε]L = L(n,1,2,\varepsilon) = \mathbb{R}^n \times [0,\varepsilon] is an isometry. This is related to the Beckman-Quarles theorem of 1953, which states that any unit-preserving mapping of Rn\mathbb{R}^n is an isometry, and to the rational analogue of this theorem obtained by A. Sokolov in 2023.

Keywords

Cite

@article{arxiv.2505.07799,
  title  = {Isomorphisms of unit distance graphs of layers},
  author = {Arthur Igorevich Bikeev},
  journal= {arXiv preprint arXiv:2505.07799},
  year   = {2025}
}