pith. sign in

arxiv: 1304.3233 · v1 · pith:5HR7GHBXnew · submitted 2013-04-11 · 🧮 math.CO

Flat-containing and shift-blocking sets in F₂^r

classification 🧮 math.CO
keywords subsetgiventhereblockedboundscontainedequivalentlyflat
0
0 comments X
read the original abstract

For non-negative integers $r\ge d$, how small can a subset $C\subset F_2^r$ be, given that for any $v\in F_2^r$ there is a $d$-flat passing through $v$ and contained in $C\cup\{v\}$? Equivalently, how large can a subset $B\subset F_2^r$ be, given that for any $v\in F_2^r$ there is a linear $d$-subspace not blocked non-trivially by the translate $B+v$? A number of lower and upper bounds are obtained.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.