BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Noga Alon (Princeton University)
DTSTART:20210104T140000Z
DTEND:20210104T150000Z
DTSTAMP:20260423T021038Z
UID:EPC/39
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/39/">Spl
 itting necklaces</a>\nby Noga Alon (Princeton University) as part of Extre
 mal and probabilistic combinatorics webinar\n\n\nAbstract\nIt is known tha
 t one can cut any opened necklace with beads of $n$ types in at most $(k-1
 )n$ points and partition the resulting intervals into k collections\, each
  containing the same number of beads of each type (up to 1). This number o
 f cuts is optimal. I will discuss some recent advances in the study of thi
 s problem focusing on its algorithmic aspects and on the case of random ne
 cklaces. \n\nBased on joint work with Anrdei Graur and on joint work in pr
 ogress with Janos Pach and Gabor Tardos.\n
LOCATION:https://researchseminars.org/talk/EPC/39/
END:VEVENT
END:VCALENDAR