Matrices and Graphs II
Another way of looking at these problems is as graphs G where the nodes of the graphs are labeled by the particles i, and one has edges linking i to j if and only if the force Fij is non zero
In these languages, long range force problems correspond to dense matrix M (all elements nonzero) and fully connected graphs G