Series

Pick theorem — the series

5 essays on one idea, from the one that introduces it to the one that assumes the rest.
  1. A lattice polygon of area 22.5. A polygon with all its corners on the integer grid, with the 20 grid points strictly inside and the 7 on its boundary marked; its area is the first count plus half the second, less one.

    Area by counting dots

    Draw a polygon with every corner on a grid of dots. Count the dots strictly inside, add half the dots on the edge, subtract one — and the answer is the area, exactly, with no measuring anywhere.

    part 1 · discrete
  2. Four solids with the same counts and every volume. The Reeve tetrahedra at heights 1, 2, 3, 5, drawn in wireframe with a table of their lattice-point counts and volumes. All have four boundary points and none inside; their volumes run from 0.17 to 0.83.

    The theorem that has no version in space

    A lattice polygon's area is decided completely by two counts of dots. The obvious guess is that a lattice solid's volume is decided by the same two counts in three dimensions, and there is a family of tetrahedra with identical counts and every volume that says otherwise.

    part 2 · discrete
  3. The sixteen lattice polygons with a single point inside. A grid of sixteen small lattice polygons, each drawn on its own patch of grid with the single interior point marked, labelled with its number of boundary points.

    Sixteen polygons with one dot inside

    Fix one of Pick's two counts at one and ask what is left. The answer is a finite list, the list has exactly sixteen entries, each one is its own kind of object with a dual that is another entry, and the whole classification is a search a page can carry out.

    part 3 · discrete
  4. The lattice-point count inside a circle, less its area, out to radius 160. A plot of the difference between the number of lattice points in a disc and the disc's area, against radius, with envelopes proportional to the square root and the two-thirds power drawn.

    The dots a circle catches

    Pick's theorem gives a lattice polygon's area exactly, with no error term anywhere. Ask a circle the same question and the exactness is gone: the count is the area plus something, the something has been measured for two centuries, and nobody knows how big it is.

    part 4 · discrete
  5. A ball counted slice by slice. Ball of radius 7.5: slices 0:177, 1:177, 2:169, 3:145, 4:129, 5:97, 6:69, 7:21; total 1791, volume 1767.146.

    The dots a ball catches

    Count the lattice points inside a ball and compare with its volume. In five dimensions the error is about the size of one spherical shell, and that is a theorem; in four a logarithm sneaks in; in three and two the true size of the error is unknown. The difficulty runs backwards because the arithmetic of sums of squares is most erratic when there are fewest squares to add.

    part 5 · discrete

All series