BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
PRODID:Data::ICal 0.24
BEGIN:VTIMEZONE
TZID:Pacific/Auckland
X-LIC-LOCATION:Pacific/Auckland
BEGIN:DAYLIGHT
DTSTART:19700927T020000
RRULE:FREQ=YEARLY;BYMONTH=9;BYDAY=-1SU
TZNAME:NZDT
TZOFFSETFROM:+1200
TZOFFSETTO:+1300
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:19700405T030000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
TZNAME:NZST
TZOFFSETFROM:+1300
TZOFFSETTO:+1200
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:SMS Seminars
CONTACT:Reshma Ramadurai
DESCRIPTION:A Latin square is an n x n array of symbols {0\,1\,...\,nâ1} in
  which each symbol occurs precisely once in each row and once in each colu
 mn. In this talk\, we show that for each Latin square L of order n\, there
 \nexists a Latin square L'\, not equal to L\, of order n such that L and L
 ' differ in at most 8sqrt(n) cells. Note that a trivial upper bound is 2n\
 , obtained simply by swapping any pair of rows. While it is conjectured to
  be of the order O(log n)\, our result is the first upper bound which is o
 (n).\n\nWe also improve previous bounds on the size of the smallest defini
 ng set in a Latin square and show that it is at least cn^{3/2} with c a co
 nstant\, where a defining set is a partial Latin square which has a unique
  completion to a Latin Square.
DTEND;TZID=Pacific/Auckland:20160311T160000
DTSTAMP:20260405T104920Z
DTSTART;TZID=Pacific/Auckland:20160311T151000
LOCATION:AM101\, Alan MacDiarmid 101
ORGANIZER:Reshma Ramadurai
SUMMARY:Reshma Ramadurai - On the distances between Latin squares
UID:seminar_sms856_20160302160825
URL:http://www.cms.waikato.ac.nz/people/reshmar
END:VEVENT
END:VCALENDAR