Forbidden sparse intersections
Abstract
Let n be a positive integer, let 0<p≤slant p'≤slant 12, and let ≤slant pn be a nonnegative integer. We prove that if F,G⊂eq \0,1\n are two families whose cross intersections forbid -- that is, they satisfy |A B|≠ for every A∈F and every B∈G -- then, setting t:=\,pn-\, we have the subgaussian bound \[ μp(F)\, μp'(G)≤slant 2( - t2582\,pn), \] where μp and μp' denote the p-biased and p'-biased measures on \0,1\n respectively.
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.