BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/746
DTSTAMP:20230914T125936Z
SUMMARY:Galvin's Proof of Dinitz's Conjecture
DESCRIPTION:Speaker: Kshitij Gajjar\n\nAbstract: \nAn n × n Latin square
is a grid with n rows and n columns such that each cell of the grid is fi
lled with one number from the set {1\,2\,...n} and no number is repeated i
n any row or any column. For instance\, any solved Sudoku puzzle is a 9 ×
9 Latin square. In 1979\, Jeff Dinitz proposed the existence of "generali
zed Latin squares"\, which became known as the Dinitz conjecture.\n\nThe D
initiz conjecture states that given an n × n grid\, a number m ≥ n\, an
d 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 hav
e found it myself ... With the very generous help of Lady Hindsight\, I wi
ll now describe how I (and you!) could have\, and should have\, found the
very same proof ...".\n\nAnd that's exactly what we will do in this talk!
\n
URL:https://www.tcs.tifr.res.in/web/events/746
DTSTART;TZID=Asia/Kolkata:20170120T160000
DTEND;TZID=Asia/Kolkata:20170120T173000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR