BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: Many results in extremal graph theory can be formulated as ine
 qualities on graph densities. While many inequalites are known\, many more 
 are conjectured. A standard tool to establish an inequality is to write the
  expression whose nonnegativity needs to be certified as a sum of squares. 
 This technique has had many successes but also limitations. In this talk I 
 will describe new restrictions that show that several simple inequalities c
 annot be certified by sums of squares. These results extend to the powerful
  frameworks of flag algebras by Razborov and graph algebras by Lovasz and S
 zegedy.   This is joint work with Greg Blekherman\, Annie Raymond\, and Moh
 it Singh. 
DTSTAMP:20190417T162000
DTSTART:20190701T141500
CLASS:PUBLIC
LOCATION:Freie Universität Berlin \n Institut für Informatik \n Takustr. 9 
 \n 14195 Berlin \n Room 005 (Ground Floor)
SEQUENCE:0
SUMMARY:Rekha R. Thomas (University of Washington): Graph Density Inequalit
 ies and Sums of Squares
UID:95691279@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20190701-L-Thomas.html
END:VEVENT
END:VCALENDAR