Iterated Point-Line Configurations Grow Doubly-Exponentially
| dc.creator | Cooper, Joshua | |
| dc.creator | Walters, Mark | |
| dc.date | 2008-07-09 | |
| dc.date.accessioned | 2026-07-07T09:49:33Z | |
| dc.date.available | 2026-07-07T09:49:33Z | |
| dc.description | 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 Radoičić (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édi-Trotter Theorem and an analysis of the ``minimum degree'' of the growing configuration. | |
| dc.description | 13 pages, 0 figures | |
| dc.identifier | https://arxiv.org/abs/0807.1549 | |
| dc.identifier | http://arxiv.org/abs/0807.1549 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/164627 | |
| dc.subject | Combinatorics | |
| dc.subject | 52C30 (Primary) 52C45, 11P70 (Secondary) | |
| dc.title | Iterated Point-Line Configurations Grow Doubly-Exponentially | |
| dc.type | text |