Tag Archives: Tamas Meszaros

Covering the binary hypercube

A finite grid is a set , where is a field and each is a finite subset of . The minimum number of hyperplanes required to cover can easily be shown to be , with the hyperplanes defined by , … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Finite Geometry, Polynomial Method | Tagged , , , , , , , , , , | 1 Comment