BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260624T081054EDT-61939K1vou@132.216.98.100
DTSTAMP:20260624T121054Z
DESCRIPTION:Title: Simple Graph Density Inequalities with no Sum of Squares
  Proofs\n\nAbstract: Establishing inequalities among graph densities is a 
 central pursuit in extremal graph theory. One way to certify the nonnegati
 vity of a graph density expression is to write it as a sum of squares or a
 s a rational sum of squares. In this talk\, we will explore how one does s
 o and we will then identify simple conditions under which a graph density 
 expression cannot be a sum of squares or a rational sum of squares. These 
 results extend to the powerful frameworks of flag algebras by Razborov and
  graph algebras by Lovász and Szegedy. This is joint work with Greg Blekhe
 rman\, Mohit Singh\, and Rekha Thomas.\n
DTSTART:20200109T203000Z
DTEND:20200109T213000Z
LOCATION:Room 708\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Annie Raymond (University of Massachusetts)
URL:/mathstat/channels/event/annie-raymond-university-
 massachusetts-303637
END:VEVENT
END:VCALENDAR