关于 $\mathbb{C}^2$ 中点数较少的 $r$-等色线
On $r$-Equichromatic Lines with few points in $\mathbb{C}^2$
AI总结：
本文研究了复平面中红绿点集的 $r$-等色线问题，证明了在特定共线点数限制下 $1$-等色线和 $2$-等色线数量的下界。
摘要：
设 $P$ 为 $\mathbb{C}^2$ 中 $n$ 个绿色点和 $n - k$ 个红色点的集合。由 $i$ 个绿色点和 $j$ 个红色点确定的直线，若满足 $i + j \ge 2$ 且 $|i - j| \le r$，则称为 \emph{$r$-等色线}。我们建立了 $1$-等色线和 $2$-等色线的下界。特别地，我们证明了若 $P$ 中至多有 $2n-k-2$ 个点共线，则经过至多六个点的 $1$-等色线数量至少为 $\frac{1}{4}(6n-k(k+3))$；若 $P$ 中至多有 $\frac{2}{3}(2n - k)$ 个点共线，则经过至多四个点的 $2$-等色线数量至少为 $\frac{1}{6}(10n - k(k + 5))$。
英文摘要：
Let $P$ be a set of $n$ green and $n - k$ red points in $\mathbb{C}^2$. A line determined by $i$ green and $j$ red points such that $i + j \ge 2$ and $|i - j| \le r$ is called \emph{r-equichromatic}. We establish lower bounds for $1$-equichromatic and $2$-equichromatic lines. In particular, we show that if at most $2n-k-2$ points of $P$ are collinear, then the number of $1$-equichromatic lines passing through at most six points is at least $\frac{1}{4}(6n-k(k+3))$, and if at most $\frac{2}{3}(2n - k)$ points of $P$ are collinear, then the number of $2$-equichromatic lines passing through at most four points is at least $\frac{1}{6}(10n - k(k + 5))$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
