Incidences between planes over finite fields
Abstract
We use methods from spectral graph theory to obtain bounds on the number of incidences between k-planes and h-planes in Fqd which generalize a recent result given by Bennett, Iosevich, and Pakianathan (2014). More precisely, we prove that the number of incidences between a set P of k-planes and a set H of h-planes with h 2k+1, which is denoted by I(P,H), satisfies \[ I(P,H)-|P||H|q(d-h)(k+1) q(d-h)h+k(2h-d-k+1)2|P||H|. \]
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.