Near optimal thresholds for existence of dilated configurations in Fqd
Abstract
Let E⊂Fqd and · :Fqd Fq defined as α:= α12+…+αd2 if α=(α1,…,αd)∈ Fqd, where Fqd is the d-dimensional vector space over the finite field Fq with q elements. Let k≥ 1 and A is a nonempty subset of \(i,j):1≤ i<j≤ k+1\. In this paper, we prove that for any nonzero square element r∈ Fq and Ekqd/2 one can find two (k+1)-tuples in E such that one of them is dilated by r with respect to the other only on |A| edges. More precisely, there exist (x1,…,xk+1)∈ Ek+1 and (y1,…,yk+1)∈ Ek+1 such that yi-yj=r xi-xj if (i,j)∈ A and xi≠ xj, yi≠ yj if 1≤ i<j≤ k+1. In particular, we present two proofs first of which utilizes the machinery of group actions which is typically used to handle problems of this nature, whereas the second one is more combinatorial in nature and is based on the averaging argument. Moreover, we show that in two dimensions the threshold d/2 is sharp when q 3 4. As a corollary of this result, varying the underlying set A we obtain thresholds for existence of dilated k-paths, k-cycles, and k-stars (k≥ 3). These results partly generalize some results of the second author.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.