Flat-containing and shift-blocking sets in F^r₂
From MaRDI portal
Publication:2249144
zbMATH Open1320.51008arXiv1304.3233MaRDI QIDQ2249144FDOQ2249144
Authors: Aart Blokhuis, Vsevolod F. Lev
Publication date: 9 July 2014
Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1304.3233
Recommendations
Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Blocking sets, ovals, (k)-arcs (51E21) Extremal combinatorics (05D99)
Cited In (2)
This page was built for publication: Flat-containing and shift-blocking sets in \({\mathbb F}^{r}_{2}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2249144)