Desargues theorem, its configurations, and the solution to a long-standing enumeration problem
From MaRDI portal
Publication:6345321
arXiv2007.09175MaRDI QIDQ6345321FDOQ6345321
James M. McQuillan, Aiden A. Bruen, Trevor C. Bruen
Publication date: 17 July 2020
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.
Finite affine and projective planes (geometric aspects) (51E15) Desarguesian and Pappian geometries (51A30)
This page was built for publication: Desargues theorem, its configurations, and the solution to a long-standing enumeration problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6345321)
