BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Harrison-Trainor (University of Michigan)
DTSTART:20220207T213000Z
DTEND:20220207T223000Z
DTSTAMP:20260423T024530Z
UID:CTA/73
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/73/">Kol
 mogorov extractors and evenly-distributed hypergraphs</a>\nby Matthew Harr
 ison-Trainor (University of Michigan) as part of Computability theory and 
 applications\n\n\nAbstract\nSuppose that we have a string which has some a
 mount of randomness\nand we want to produce from it\, in an effective way\
 , a string which is more\nrandom. Though we cannot do this\, it is possibl
 e to produce two strings\, at\nleast one of which is more random than the 
 original string. Moreover\, the more\nstrings we are allowed to produce\, 
 the more we can increase the randomness.\nHow much can we increase the ran
 domness\, and how many strings are required?\nThis question turns out to b
 e related to a purely graph-theoretic question\nabout how evenly the edges
  of a hypergraph can be distributed.\n
LOCATION:https://researchseminars.org/talk/CTA/73/
END:VEVENT
END:VCALENDAR