Evasive sets, twisted varieties, and container-clique trees

Abstract

In the affine space Fqn over the finite field of order q, a point set S is said to be (d,k,r)-evasive if the intersection between S and any variety, of dimension k and degree at most d, has cardinality less than r. As q tends to infinity, the size of a (d,k,r)-evasive set in Fqn is at most O(qn-k) by a simple averaging argument. We exhibit the existence of such evasive sets of sizes at least (qn-k) for much smaller values of r than previously known constructions, and establish an enumerative upper bound 2O(qn-k) for the total number of such evasive sets. The existence result is based on our study of twisted varieties. In the projective space Pn over an algebraically closed field, a variety V is said to be d-twisted if the intersection between V and any variety, of dimension n - (V) and degree at most d, has dimension zero. We prove an upper bound on the smallest possible degree of twisted varieties which is best possible in a mild sense. The enumeration result includes a new technique for the container method which we believe is of independent interest. To illustrate the potential of this technique, we give a simpler proof of a result by Chen--Liu--Nie--Zeng that characterizes the maximum size of a collinear-triple-free subset in a random sampling of Fq2 up to polylogarithmic factors.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…