BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Jared Duker Lichtman (University of Oxford)
DTSTART:20200603T173000Z
DTEND:20200603T175500Z
DTSTAMP:20260423T011157Z
UID:CANT2020/36
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2020/36/
 ">The Erdos primitive set conjecture</a>\nby Jared Duker Lichtman (Univers
 ity of Oxford) as part of Combinatorial and additive number theory (CANT 2
 021)\n\n\nAbstract\nA set of integers larger than 1 is called <i>primitive
 </i> if no member divides another. \nErdős proved in 1935 that the sum of
  $1/(n\\log n)$ over $n$ in a primitive set $A$ \nis universally bounded f
 or any choice of $A$. In 1988\, he famously asked \nif this universal boun
 d is attained by the set of prime numbers. \nIn this talk we shall discuss
  some recent progress towards this conjecture \nand related results\, draw
 ing on ideas from analysis\, probability\, and combinatorics.\n
LOCATION:https://researchseminars.org/talk/CANT2020/36/
END:VEVENT
END:VCALENDAR