Lexicographic Configurations
Combinatorics
2012-11-09 v1
Abstract
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.
Cite
@article{arxiv.1211.1899,
title = {Lexicographic Configurations},
author = {Christoph Hering and Andreas Krebs and Thomas Edgar},
journal= {arXiv preprint arXiv:1211.1899},
year = {2012}
}
Comments
15 pages, 2 figures