BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Gal Kronenberg (Oxford)
DTSTART:20220615T130000Z
DTEND:20220615T140000Z
DTSTAMP:20260423T021101Z
UID:WCS/56
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/56/">Ind
 ependent sets in random subgraphs of the hypercube</a>\nby Gal Kronenberg 
 (Oxford) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nIndepende
 nt sets in bipartite regular graphs have been studied extensively in combi
 natorics\, probability\, computer science and more. The problem of countin
 g independent sets is particularly interesting in the $d$-dimensional hype
 rcube $\\{0\,1\\}^d$\, motivated by the lattice gas hardcore model from st
 atistical physics. Independent sets also turn out to be very interesting i
 n the context of random graphs.\n\nThe number of independent sets in the h
 ypercube $\\{0\,1\\}^d$ was estimated precisely by Korshunov and Sapozhenk
 o in the 1980s and recently refined by Jenssen and Perkins.\n\nIn this tal
 k we will discuss new results on the number of independent sets in a rando
 m subgraph of the hypercube. The results extend to the hardcore model and 
 rely on an analysis of the antiferromagnetic Ising model on the hypercube.
 \n\nThis talk is based on joint work with Yinon Spinka.\n
LOCATION:https://researchseminars.org/talk/WCS/56/
END:VEVENT
END:VCALENDAR