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 Edit this on Wikidata


Publication date: 9 July 2014

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: For non-negative integers rged, how small can a subset CsubsetF2r be, given that for any vinF2r there is a d-flat passing through v and contained in Ccupv? Equivalently, how large can a subset BsubsetF2r be, given that for any vinF2r there is a linear d-subspace not blocked non-trivially by the translate B+v? A number of lower and upper bounds are obtained.


Full work available at URL: https://arxiv.org/abs/1304.3233




Recommendations





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)