Graph explorer

Lexicographic Configurations

We describe a new way to construct finite geometric objects. For every k we obtain a symmetric configuration E(k-1) with k points on a line. In particular, we have a constructive existence proof for such configurations. The method is very simple and purely geometric. It also produces interesting periodic matrices.