Adam Brown, Peter Nelson
Published 2017-08-22Version 1
We construct, for every $r \ge 3$ and every prime power $q > 10$, a rank-$r$ matroid with no $U_{2,q+2}$-minor, having more hyperplanes than the rank-$r$ projective geometry over $\mathrm{GF}(q)$.
Blocking subspaces with points and hyperplanes
Slicing all Edges of an $n$-cube Requires $n^{2/3}$ Hyperplanes
Free paths of arrangements of hyperplanes
![QR code for arXiv:1708.06790 [math.CO]](http://oss.arxitics.com/images/favicon.svg)