University of Cambridge > Talks.cam > Trinity Mathematical Society > Sum-of-squares proofs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Sum-of-squares proofs

Download to your calendar using vCal

If you have a question about this talk, please contact .

A polynomial that is a sum of squares of other polynomials can only take nonnegative values. This trivial observation is surprisingly powerful: many inequalities in mathematics have simple sum-of-squares proofs. I will discuss algorithms that can automatically search for sum-of-squares proofs for polynomial inequalities, and the extent to which they can be considered as “automatic proof machines”.

This talk is part of the Trinity Mathematical Society series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Developmental Biology Seminar Series Scott Lectures Heart and Lung Research Institute (R.100) or Virtually via Zoom: https://sanger.zoom.us/j/97135269370?pwd=YgsqXLPVYzO9oYY5CObjlWxNPtmBus.1

Other talks

Task performance predicts the substitution of feedforward by feedback drive in visual cortex Coming soon The Gardens of the Western Cape TBC Novel neuroimaging methods in Lewy body dementia Online Causal Inference Seminar
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity