Maximum in-general-position set in a random subset of $\mathbb{F}^d_q$
Combinatorics
2025-09-09 v1
Abstract
Let be the maximum possible size of a point set in general position in a -random subset of . We determine the order of magnitude of up to a polylogarithmic factor by proving the balanced supersaturation conjecture of Balogh and Luo. Our result also resolves a conjecture implicitly posed by the first author, Liu, the second author and Zeng. In the course of our proof, we establish a lemma that demonstrates a ``structure vs. randomness'' phenomenon for point sets in finite-field linear spaces, which may be of independent interest.
Cite
@article{arxiv.2509.06403,
title = {Maximum in-general-position set in a random subset of $\mathbb{F}^d_q$},
author = {Yaobin Chen and Jiaxi Nie and Jing Yu and Wentao Zhang},
journal= {arXiv preprint arXiv:2509.06403},
year = {2025}
}
Comments
25 pages, 1 figures