Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem (Q1137067)
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: Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem |
scientific article; zbMATH DE number 3666901
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem |
scientific article; zbMATH DE number 3666901 |
Statements
Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem (English)
0 references
1980
0 references
Sei \(U = \{u_0,u_1, \dots,u_n)\subset\mathbb Z^2\) und \(d(U) = \frac1m \sum_{i=1}^n \| u_i - u_{i-1}\|\). Als Analogon zu einem Ergebnis von \textit{E. Szemerédi} [Acta Arith. 27, 199--245 (1975; Zbl 0303.10056)] zeigt Verf. den folgenden Satz: Zu jedem \(k\in\mathbb N\) und \(B\in\mathbb R_+\) gibt es eine Zahl \(m(k,B)\), so daß für \(m>m(k,B)\) und \(d(U)\leq B\) die Menge \(U\) mindestens \(k\) Punkte enthält, die auf einer Geraden liegen. Der Beweis ist elementar.
0 references
collinear subsets
0 references
plane lattice points
0 references
0 references
0 references
0.8652023
0 references
0.85438114
0 references
0.85333043
0 references
0.85333025
0 references
0.84758556
0 references
0.8473413
0 references
0.84710467
0 references