University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Effectivity and Complexity Results in Hilbert's 17th problem Marie-Françoise Roy Université de Rennes 1, France

Effectivity and Complexity Results in Hilbert's 17th problem Marie-Françoise Roy Université de Rennes 1, France

Add to your list(s) Download to your calendar using vCal

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

This talk has been canceled/deleted

Hilbert 17th problem asks whether a polynomial taking

  only non-negative
values is a sum of squares (in the field of

  rational
functions).  Its positive solution around
1925 by Artin

  does not make it
possible to construct the sum of squares. Since

  then, some
progress made it possible to give such contructions and

  to bound the
degrees of the polynomials appearing in the sum of

  squares. An
explicit recent proof gives elementary recursive degree

  bounds. The
method of construction illustrates the current renewal

  of constructive
algebra.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.

 

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