All Questions

The following may be well-known $-$ but not known to me: What is the smallest possible size of a set in ${\mathbb F}_2^n$ that blocks every $2$-flat? Here "blocks" means "have a non-empty ...

$\newcommand{\F}{\mathbb F}$ A subset $P$ of the affine plane $\F_p^2$ is said to determine a direction if there is a line in this direction containing at least two points of $P$. A set of size $|P|&...

$\newcommand{\F}{{\mathbb F}}$ Let $q$ be an odd prime power. A blocking set in the affine plane $\F_q^2$ is a set blocking (meeting) every line. A union of two non-parallel lines is a blocking set ...

A square in $\mathbb F_2^n\oplus\mathbb F_2^n$ is a quadruple of the form $$ (u,v)+\{(0,0),(0,d),(d,0),(d,d)\},\quad u,v,d\in\mathbb F_2^n,\ d\ne 0. $$ A set $A\subset\mathbb F_2^n\oplus\mathbb F_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. ...