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:20220525T153000Z
DTEND:20220525T155500Z
DTSTAMP:20260423T011218Z
UID:CANT2022/21
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CANT2022/21/
 ">A proof of the Erdos primitive set conjecture</a>\nby Jared Duker Lichtm
 an (University of Oxford) as part of Combinatorial and additive number the
 ory (CANT 2022)\n\n\nAbstract\nA set of integers greater than 1 is primiti
 ve if no member in the set divides another. Erdos proved in 1935 that the 
 series of $1/(n\\log n)$\, ranging over $n$ in $A$\, is uniformly bounded 
 over all choices of primitive sets $A$. In 1988 he asked if this bound is 
 attained for the set of prime numbers. In this talk we describe recent wor
 k which answers Erdos' conjecture in the affirmative. We will also discuss
  applications to old questions of Erdos\, Sarkozy\, and Szemeredi from the
  1960s.\n
LOCATION:https://researchseminars.org/talk/CANT2022/21/
END:VEVENT
END:VCALENDAR