[1] viXra:2306.0081 [pdf] submitted on 2023-06-14 03:36:54
Authors: Richard J. Mathar
Comments: 12 Pages.
The L1 distance between two points in a square lattice is the sum of horizontal and vertical absolute differences of the Cartesian coordinates and - as in graph theory - also the minimumnumber of edges to walk to reach one point from the other. The manuscript contains a Java program that computes in a finite square grid of fixed shapethe number of point pairs as a function of that distance.
Category: Statistics