BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability seminar
SUMMARY:Lagrangians of hypergraphs - Shoham Letzter (ETH Z
urich)
DTSTART:20190307T130000Z
DTEND:20190307T140000Z
UID:TALK3599AT
URL:/talk/index/3599
DESCRIPTION:Frankl and Füredi conjectured (1989) that any r-un
iform hypergraph\, whose edges form an initial seg
ment of length m in the colex ordering\, maximises
the Lagrangian among all r-uniform hypergraphs wi
th m edges\, for all r and m. We prove this conjec
ture for r=3 (and large m)\, and disprove it for l
arger r (and a wide range of m). In the talk I wil
l explain the notion of Lagrangians and focus on t
he counterexamples to the conjecture.\n\n\n
LOCATION:Watson LTB
CONTACT:Richard Montgomery
END:VEVENT
END:VCALENDAR