Non UBC
DSpace
Rekha Thomas
2019-11-26T09:45:30Z
2019-05-29T09:01
Many results in extremal graph theory can be formulated as inequalities on graph densities. While many inequalities are known, many more are conjectured. A standard tool to establish an inequality is to write the expression whose non-negativity 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 cannot be certified by sums of squares. These results extend to the powerful frameworks of flag algebras by Razborov and graph algebras by Lovasz and Szegedy.
Joint work with Greg Blekherman, Annie Raymond and Mohit Singh.
https://circle.library.ubc.ca/rest/handle/2429/72414?expand=metadata
58.0 minutes
video/mp4
Author affiliation: University of Washington
Banff (Alta.)
10.14288/1.0385894
eng
Unreviewed
Vancouver : University of British Columbia Library
Banff International Research Station for Mathematical Innovation and Discovery
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
Faculty
BIRS Workshop Lecture Videos (Banff, Alta)
Mathematics
Operations Research, Mathematical Programming, Algebraic Geometry, Control/Optimization/Operation Research
Graph Density Inequalities and Sums of Squares
Moving Image
http://hdl.handle.net/2429/72414