Skip to main content
10 of 11
added 143 characters in body
Ashot
  • 337
  • 1
  • 9

$(n-2)$-blocking sets in $AG(n,2)$

Let's define $k$-blocking set in affine space $AG(n,q)$ a set that meets every coset (translate of subspace) of dimension $k$.

I have seen a lot work related to minimal $(n-1)$-blockings set.

Covering finite fields with cosets of subspaces.

The Blocking Number of an Affine Space

In these articles it is proved that minimal $(n-1)$-blocking has $n(q-1)+1$ points.

I can't find any result about minimal $(n-2)$-blocking sets (even for $AG(n,2)$). I have managed to prove following bounds about $(n-2)$-blocking set in $AG(n,2)$. It has at least $2n-1$ and no more than $3n^{\log_{2} 3}+1$ points.

Here is a link to my paper. http://ysu.am/files/8.On%20The%20Minimal%20Coset%20Covering%20of%20Solutions%20of%20a%20Boolean%20Equation.pdf

I am very interested in the solution of the problem. Does anyone have any information about it?

I have also asked following questions related to problem: http://math.stackexchange.com/questions/869308/blocking-set-for-cosets-of-codimension-2 http://math.stackexchange.com/questions/863592/find-minimal-set-of-cosets-c-so-that-each-2-vectors-in-a-n-are-in-one-cos

Ashot
  • 337
  • 1
  • 9