Two-distance preserving functions (Q1856601)

In [Period. Math. Hung. 39, No. 1-3, 185-200 (1999; Zbl 0968.51009)], \textit{K. Bezdek} and \textit{R. Connelly} have proved the following theorem: Let \(n\geq 2\), \(0<c<s\), \(0<c/s<(\sqrt{5}-1)/2\), and let \(f: E^n\to E^m\) be any function such that (\(\forall p,q\in E^n\)) ((\(|p-q|=c \Rightarrow |f(p)-f(q)|\leq c\)) \& (\(|p-q|=s \Rightarrow |f(p)-f(q)|\geq s\))). Then \(f\) is a congruence. Here \(E^n\) stands for the Euclidean \(n\)-space; \(m\) is arbitrary. The paper under review provides a new proof for this theorem. Among peculiarities of this new proof we should mention that it involves fewer cases and that the mathematical software, Maple, is used to carry out routine calculations.