Tag Archives: Shagnik Das

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

The dual version of Ryser’s conjecture

I talked about our new results related to Ryser’s conjecture in a previous post (also see an even earlier post). The conjecture, and its variants, have some interesting equivalent formulations in terms of edge colourings of graphs. While I was … Continue reading

Posted in Combinatorics, Extremal Combinatorics, Uncategorized | Tagged , , , , , , , , , , | Leave a comment

Extending Ryser’s conjecture

In an earlier post, I talked about Ryser’s conjecture on -partite -uniform hypergraphs, that has stayed open for all despite a considerable effort by several mathematicians over a period of 50 years. A bit more effort has been spent on … Continue reading

Posted in Combinatorics, Extremal Combinatorics | Tagged , , , , , , , | 1 Comment