The shortest path problem for the distant graph of the projective line over the ring of integers (Q1695600): Difference between revisions

The projective line over a ring gives rise to a distant graph \(G=(\mathbb{P}(R),\Delta)\) with the points of \(\mathbb{P}(R)\) as vertices and the undirected pairs of distant points as edges. The authors solve the shortest path problem for this graph in case \(R\) is the ring \(\mathbb{Z}\) of integers, using a geometric interpretation of continued fractions. They also formulate necessary and sufficient conditions for the existence of a unique shortest path.