An improvement on the number of simplices in Fqd
Abstract
Let E be a set of points in Fqd. Bennett, Hart, Iosevich, Pakianathan, and Rudnev (2016) proved that if |E| qd-d-1k+1 then E determines a positive proportion of all k-simplices. In this paper, we give an improvement of this result in the case when E is the Cartesian product of sets. More precisely, we show that if E is the Cartesian product of sets and qkdk+1-1/d=o(|E|), the number of congruence classes of k-simplices determined by E is at least (1-o(1))qk+12, and in some cases our result is sharp.
0
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.