BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A new algebraic approach to the wreath conjecture - Speaker to be 
 confirmed
DTSTART:20250213T143000Z
DTEND:20250213T153000Z
UID:TALK227758@talks.cam.ac.uk
CONTACT:103978
DESCRIPTION: In 1970s\, Baranyai proved that the hyperedges of the k-unifo
 rm complete hypergraph on n vertices can be decomposed into perfect matchi
 ngs whenever k divides n. In the same paper\, he posed a more general conj
 ecture. Katona\, who later rephrased this conjecture as decomposing [n]^(k
 ) into so-called wreaths\, wrote "Baranyai’s brilliant idea was to use m
 atrices and flows in networks. This conjecture\, however\, seems to be too
  algebraic. One does not expect to solve it without algebra. (Unless it is
  not true.)". In this talk\, we will discuss a new algebraic approach to t
 he wreath conjecture\, defining a matrix encoding the problem and studying
  its properties.\n(based on joint work with Pavel Turek)
LOCATION:MR12
END:VEVENT
END:VCALENDAR