Flat-containing and shift-blocking sets in $F_2^r$
Combinatorics
2013-04-12 v1
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.
Cite
@article{arxiv.1304.3233,
title = {Flat-containing and shift-blocking sets in $F_2^r$},
author = {Aart Blokhuis and Vsevolod F. Lev},
journal= {arXiv preprint arXiv:1304.3233},
year = {2013}
}