In crystallography and the theory of infinite vertex-transitive graphs, the coordination sequence of a vertex ${\displaystyle v}$ is an integer sequence that counts how many vertices are at each possible distance from ${\displaystyle v}$. That is, it is a sequence

$${\displaystyle n_{0},n_{1},n_{2},\dots }$$

where each ${\displaystyle n_{i}}$ is the number of vertices that are ${\displaystyle i}$ steps away from ${\displaystyle v}$. If the graph is vertex-transitive, then the sequence is an invariant of the graph that does not depend on the specific choice of ${\displaystyle v}$. Coordination sequences can also be defined for sphere packings, by using either the contact graph of the spheres or the Delaunay triangulation of their centers, but these two choices may give rise to different sequences.^[1][2]

A square grid, shaded by distance from the central blue point. The number of grid points at distance exactly ${\displaystyle i>0}$ is ${\displaystyle 4i}$, so the coordination sequence of the grid is the sequence of multiples of four, modified to start with one instead of zero.

As an example, in a square grid, for each positive integer ${\displaystyle i}$, there are ${\displaystyle 4i}$ grid points that are ${\displaystyle i}$ steps away from the origin. Therefore, the coordination sequence of the square grid is the sequence

$${\displaystyle 1,4,8,12,16,20,\dots \ .}$$

in which, except for the initial value of one, each number is a multiple of four.^[3]

The concept was proposed by Georg O. Brunner and Fritz Laves and later developed by Michael O'Keefe. The coordination sequences of many low-dimensional lattices^[2][4] and uniform tilings are known.^[5][6]

The coordination sequences of periodic structures are known to be quasi-polynomial.^[7][8]

References