BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Robin Frot (Alfréd Rényi Institute of Mathematics)
DTSTART:20220606T130000Z
DTEND:20220606T140000Z
DTSTAMP:20260423T021330Z
UID:GANT/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/GANT/11/">Ex
 plicit bounds for prime gaps and graphic sequence</a>\nby Robin Frot (Alfr
 éd Rényi Institute of Mathematics) as part of Greek Algebra & Number The
 ory Seminar\n\n\nAbstract\nA prime gap graph is defined to be a graph on $
 n$ vertices with respective degrees $1$ and the $n-1$ first prime gaps.  I
 n a recent paper of P. Erdős\, G. Harcos\, S. Kharel\, P. Maga\, T. Mezei
 \, Z. Toroczkai\, they proved that under RH\, prime gap graphs exist for e
 very $n$. Also they exist unconditionally for $n$ large enough. Moreover\,
  it is possible to give an iterative construction of these graphs. \n\nThe
  ideas in this result lie between elementary number theory\, graph theory 
 and combinatorics. In this talk\, I will explain how to obtain this result
  in its unconditional form\, while trying to find explicitly how large $n$
  should be to get a graphic sequence.\n\nThis talk is based on the aforeme
 ntioned paper\, and a joint work with Keshav Aggarwal.\n
LOCATION:https://researchseminars.org/talk/GANT/11/
END:VEVENT
END:VCALENDAR