Isomorphisms of unit distance graphs of layers
Abstract
For any ∈ (0,+∞), consider the metric spaces R × [0,] in the Euclidean plane named layers or strips. B. Baslaugh in 1998 found the minimal width ∈ (0,1) of a layer such that its unit distance graph contains a cycle of a given odd length k. 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] are non-isomorphic for any different values 1,2 ∈ (0,+∞). We also get a multidimensional analogue of this theorem. For given n,m ∈ N, p ∈ (1,+∞), ∈ (0,+∞), we say that the metric space on Rn × [0,]m with the metric space distance generated by lp-norm in Rn+m is a layer L(n,m,p,). We show that the unit distance graphs of layers L(n,m,p,1), L(n,m,p,2) are non-isomorphic for 1 ≠ 2. The third main result of this paper is the theorem that, for n ≥ 2, > 0, any automorphism φ of the unit distance graph of layer L = L(n,1,2,) = Rn × [0,] is an isometry. This is related to the Beckman-Quarles theorem of 1953, which states that any unit-preserving mapping of Rn is an isometry, and to the rational analogue of this theorem obtained by A. Sokolov in 2023.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.