Desargues theorem, its configurations, and the solution to a long-standing enumeration problem
Combinatorics
2020-07-21 v1
Abstract
We solve a long-standing problem by enumerating the number of non-degenerate Desargues configurations. We extend the result to the more difficult case involving Desargues blockline structures in Section 8. A transparent proof of Desargues theorem in the plane and in space is presented as a by-product of our methods.
Cite
@article{arxiv.2007.09175,
title = {Desargues theorem, its configurations, and the solution to a long-standing enumeration problem},
author = {Aiden A. Bruen and Trevor C. Bruen and James M. McQuillan},
journal= {arXiv preprint arXiv:2007.09175},
year = {2020}
}