2000 character limit reached
Flat-containing and shift-blocking sets in
Published 11 Apr 2013 in math.CO | (1304.3233v1)
Abstract: For non-negative integers , how small can a subset be, given that for any there is a -flat passing through and contained in ? Equivalently, how large can a subset be, given that for any there is a linear -subspace not blocked non-trivially by the translate ? A number of lower and upper bounds are obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper.