Iterated point-line configurations grow doubly-exponentially

From MaRDI portal
Publication:2380786

DOI10.1007/S00454-009-9208-9zbMATH Open1194.51002arXiv0807.1549OpenAlexW2053804693MaRDI QIDQ2380786FDOQ2380786


Authors: Joshua Cooper, Mark Walters Edit this on Wikidata


Publication date: 12 April 2010

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Begin with a set of four points in the real plane in general position. Add to this collection the intersection of all lines through pairs of these points. Iterate. Ismailescu and Radoiv{c}i'{c} (2003) showed that the limiting set is dense in the plane. We give doubly exponential upper and lower bounds on the number of points at each stage. The proof employs a variant of the Szemer'edi-Trotter Theorem and an analysis of the ``minimum degree of the growing configuration.


Full work available at URL: https://arxiv.org/abs/0807.1549




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Iterated point-line configurations grow doubly-exponentially

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380786)