English

On $r$-Equichromatic Lines with few points in $\mathbb{C}^2$

Combinatorics 2024-08-28 v1

Abstract

Let PP be a set of nn green and nkn - k red points in C2\mathbb{C}^2. A line determined by ii green and jj red points such that i+j2i + j \ge 2 and ijr|i - j| \le r is called \emph{r-equichromatic}. We establish lower bounds for 11-equichromatic and 22-equichromatic lines. In particular, we show that if at most 2nk22n-k-2 points of PP are collinear, then the number of 11-equichromatic lines passing through at most six points is at least 14(6nk(k+3))\frac{1}{4}(6n-k(k+3)), and if at most 23(2nk)\frac{2}{3}(2n - k) points of PP are collinear, then the number of 22-equichromatic lines passing through at most four points is at least 16(10nk(k+5))\frac{1}{6}(10n - k(k + 5)).

Keywords

Cite

@article{arxiv.2408.14705,
  title  = {On $r$-Equichromatic Lines with few points in $\mathbb{C}^2$},
  author = {Dickson Y. B. Annor},
  journal= {arXiv preprint arXiv:2408.14705},
  year   = {2024}
}
R2 v1 2026-06-28T18:24:40.846Z