Papers
Topics
Authors
Recent
Search
2000 character limit reached

Flat-containing and shift-blocking sets in F2rF_2^r

Published 11 Apr 2013 in math.CO | (1304.3233v1)

Abstract: For non-negative integers r≥dr\ge d, how small can a subset C⊂F2<sup>rC\subset F_2<sup>r be, given that for any v∈F2<sup>rv\in F_2<sup>r there is a dd-flat passing through vv and contained in C∪vC\cup{v}? Equivalently, how large can a subset B⊂F2<sup>rB\subset F_2<sup>r be, given that for any v∈F2<sup>rv\in F_2<sup>r there is a linear dd-subspace not blocked non-trivially by the translate B+vB+v? A number of lower and upper bounds are obtained.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.