Iterated point-line configurations grow doubly-exponentially (Q2380786)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Iterated point-line configurations grow doubly-exponentially |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Iterated point-line configurations grow doubly-exponentially |
scientific article |
Statements
Iterated point-line configurations grow doubly-exponentially (English)
0 references
12 April 2010
0 references
Begin with four points of the real affine plane in general position. Add to this collection the intersection points of all lines joining two different of the four starting points. Iterate this process. A natural question is: How many points are present at the \(k\)-th stage? (Stage 1 begins with the empty affine plane and ends with four points and six lines.) Stage \(k\) ends with \(n_k\) points determining \(m_k\) lines. The main result of the paper says: There exist real positive constants \(c_1\) and \(c_2\) such that \[ c_{1}4^{1.0488^k}\leq\,n_k\leq\,c_{2}4^{4^k} \] for all \(k\in{\mathbb N}\). Thus the growth of \(n_k\) is doubly exponential.
0 references
real plane affine geometry
0 references
iterated configuration
0 references
degree of a point
0 references
\(n\times\,n\) grid
0 references
crossing number of a graph
0 references
Szmerédi-Trotter theorem
0 references
pigeonhole principle
0 references
0.7522907257080078
0 references
0.7370566129684448
0 references
0.7190722227096558
0 references
0.712195098400116
0 references