BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf77b6c364b
DTSTART;TZID=America/Toronto:20250602T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250602T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-gr
 aph-theory-amin-bahmanian
SUMMARY:Algebraic Graph Theory-Amin Bahmanian
CLASS:PUBLIC
DESCRIPTION:TITLE: A Sudoku Baranyai's Theorem\n\nSPEAKER:\n Amin Bahmania
 n\n\nAFFILIATION: \n\nIllinois State University \n\nLOCATION:\n Please co
 ntact Sabrina Lato for Zoom link.\n\nABSTRACT: Motivated by constructing
  higher dimensional Sudokus we\ngeneralize the famous Baranyai's theorem. 
 Let$n=\\prod_{i=1}^d a_i$.\nSuppose that an $n\\times\\dots \\times n$ ($d
 $ times) array $L$ is\npartitioned into$n/a_1\\times\\dots\\times n/a_d$ s
 ub‐arrays (called\nblocks). Can we color the $n^d$ cells of $L$ with $n^
 {d21}$ colors so\nthat each layer (obtained by fixing one coordinate) and 
 each\n$n/a_1\\times\\dots\\times n/a_d$block contains each color exactly o
 nce?\nWe generalize the well‐know theorem of Baranyai to answer this\nqu
 eestion. The case $d=2 a_1=a_2=3$ corresponds to the usual Sudoku.\nWe als
 o provide finite fieldconstruction of various related objects.\nThis is jo
 int work with Sho Suda.
DTSTAMP:20260403T081758Z
END:VEVENT
END:VCALENDAR