Speaker: |
Kshitij Gajjar |

Organiser: |
Aditya Nema |

Date: |
Friday, 20 Jan 2017, 16:00 to 17:30 |

Venue: |
A-201 (STCS Seminar Room) |

(Scan to add to calendar)

The Dinitiz conjecture states that given an n × n grid, a number m ≥ n, and for each cell of the grid an n-element subset of {1,2,...,m}, it is possible to fill each cell with one of those elements such that no number is repeated in any row or any column. In 1994, Fred Galvin proved Dinitz's conjecture. Doron Zeilberger wrote of Galvin's proof, "When I finished reading and digesting the proof, I kicked myself. I felt that I could have found it myself ... With the very generous help of Lady Hindsight, I will now describe how I (and you!) could have, and should have, found the very same proof ...".

And that's exactly what we will do in this talk!