BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:5853@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20221201T140000
DTEND;TZID=Europe/Paris:20221201T150000
DTSTAMP:20241120T200638Z
URL:https://www.i2m.univ-amu.fr/evenements/a-proof-of-the-erdos-primitive-
 set-conjecture/
SUMMARY:Jared D. Lichtman (Université d'Oxford\, Royaume-Uni): A proof of 
 the Erdős primitive set conjecture
DESCRIPTION:Jared D. Lichtman: A set of integers greater than 1 is primitiv
 e if no member in the set divides another. Erdős proved in 1935 that the 
 sum of 1/(a log a)\, ranging over a in A\, is uniformly bounded over all c
 hoices 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 work which answ
 ers Erdős’ conjecture in the affirmative. We will also discuss applicat
 ions to old questions of Erdős\, Sárközy\, and Szemerédi from the 1960
 s.\n&nbsp\;
ATTACH;FMTTYPE=image/jpeg:https://www.i2m.univ-amu.fr/wp-content/uploads/2
 022/11/Jared_D_Lichtman.png
CATEGORIES:Séminaire,Ernest
LOCATION:I2M Luminy - Ancienne BU\, Salle Séminaire2 (RdC)\, 163 Avenue de
  Luminy\, 13009 Marseille\, France\, 
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=163 Avenue de Luminy\, 1300
 9 Marseille\, France\, ;X-APPLE-RADIUS=100;X-TITLE=I2M Luminy - Ancienne B
 U\, Salle Séminaire2 (RdC):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20221030T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR