On distance graphs in rational spaces (Q6098044): Difference between revisions

Let \(Q_n\) be the set of all positive definite rational quadratic forms on \(n\) variables. For any \(q\in Q_n\), let \(G(Q_n, q)\) denote the graph with vertex set \(Q_n\). Two vertices \(x, y \in Q_n\) are adjacent in the graph if and only if \(q(x - y) = 1\). This notion generalises standard Euclidean distance graphs. In this paper, the authors study these graphs and show how to find the exact value of the clique number of the graph \(G(Q_n, q)\). They also prove a rational analogue of the Beckman-Quarles theorem that any unit-preserving bijection of \(Q_n\) onto itself is an isometry.