Flat-containing and shift-blocking sets in F2r
Abstract
For non-negative integers r d, how small can a subset C⊂ F2r be, given that for any v∈ F2r there is a d-flat passing through v and contained in C\v\? Equivalently, how large can a subset B⊂ F2r be, given that for any v∈ F2r there is a linear d-subspace not blocked non-trivially by the translate B+v? A number of lower and upper bounds are obtained.
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.