On the number of monochromatic lines in \(\mathbb{R}^d\) (Q2022615)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of monochromatic lines in \(\mathbb{R}^d\) |
scientific article |
Statements
On the number of monochromatic lines in \(\mathbb{R}^d\) (English)
0 references
29 April 2021
0 references
In the paper under review the author studies monochromatic lines in \(\mathbb{R}^{d}\). Let \(X \subset \mathbb{R}^{d}\) be a non-empty set and \(m \in \mathbb{N}\). A coloring of \(X\) is a family of pairwise disjoint subsets \(\{X_{1}, \dots, X_{m}\}\) of \(X\) such that \(X = \bigcup_{i=1}^{m} X_{i}\) -- we will denote the coloring exactly in the same way, namely \(X = \bigcup_{i=1}^{m} X_{i}\). Each \(X_{i}\) will be called a chromatic class. A translation \(F\) of a vector subspace \(V\) of \(\mathbb{R}^{d}\) will be called a flat, for instance a \(1\)-dimensional flat is just a line. Given a coloring \(X = \bigcup_{i=1}^{m} X_{i}\), we say that a line \(L\) of \(\mathbb{R}^{d}\) is monochromatic if \(X \cap L\) is contained in a chromatic class and \(|X \cap L | \geq 2\). The family of monochromatic lines with respect to coloring \(X = \bigcup_{i=1}^{m} X_{i}\) will be denoted by \(\mathcal{M}(\bigcup_{i=1}^{m} X_{i})\). We will write \(\bigg|\mathcal{M}(\bigcup_{i=1}^{m} X_{i})\bigg| = \Theta(|X|^{2})\) if there are constants \(c,c' > 0\) such that \[|X|^{2}/c \leq |\mathcal{M}(\bigcup_{i=1}^{m} X_{i})| \leq c|X|^{2}\] whenever \(|X| \geq c'\). If the constants \(c\) and \(c'\) depend on the parameters \(c_{1}, c_{2}, \dots\), then we write \[\bigg|\mathcal{M}(\bigcup_{i=1}^{m} X_{i})\bigg| = \Theta_{c_{1}, c_{2}, \dots}(|X|^{2}).\] The main aim of the paper under review is to study under which conditions, if there are no hyperplanes in \(\mathbb{R}^{d}\) containing a lot of points of \(X\), we have \(|\mathcal{M}(\bigcup_{i=1}^{m} X_{i})| = \Theta(|X|^{2})\). The first results towards this direction is the following. Theorem A. Let \(X\) be a non-empty finite subset of \(\mathbb{R}^{d}\) with \(\dim X = d\), a coloring \(X = \bigcup_{i=1}^{m} X_{i}\) with \(m < d\), \(0 < c' \leq 1\), and \(0 < c < 1\). If there is a chromatic class \(X_{i}\) such that \(|X_{i}| \geq c'|X|\) and \(|X_{i} \cap H| \leq c|X_{i}|\) for any hyperplane \(H\) of \(\mathbb{R}^{d}\), then \[\bigg|\mathcal{M}(\bigcup_{i=1}^{m} X_{i}) \bigg| = \Theta_{c,c',m,d}(|X|^{2}).\] The second main result of the paper under can be formulated as follows. Theorem B. Let \(X\) be a non-empty finite subset of \(\mathbb{R}^{d}\) with \(\dim X = d\), a coloring \(X = \bigcup_{i=1}^{m} X_{i}\) with \(2m \leq d\) and \(0 < c < 1\). If \(|X \cap H| \leq c|X|\) for any hyperplane \(H\) of \(\mathbb{R}^{d}\), then \[\bigg| \mathcal{M}(\bigcup_{i=1}^{m} X_{i}) \bigg| = \Theta_{c,m,d}(|X|^{2}).\] The last main result of the paper is a weak colorful version on Beck's theorem on two extremes. Theorem C. Let \(X\) be a non-empty finite subset of \(\mathbb{R}^{d}\) with \(\dim X = d\) and a coloring \(X = \bigcup_{i=1}^{m} X_{i}\) with \(m < d\). If \(|X \cap H| \leq |X|/(2d)\) for any hyperplane \(H\) in \(\mathbb{R}^{d}\), then \[\bigg|\mathcal{M}(\bigcup_{i=1}^{m} X_{i}) \bigg| =\Theta_{m,d}(|X|^{2}).\]
0 references
coloring
0 references
Szemerédi-Trotter theorem
0 references
generated hyperplanes
0 references
monochromatic lines
0 references
0 references