Hoppa till sidans huvudinnehåll

Del 0

Elementary Recursive Bound for Effective Positivstellensatz and Hilbert's 17th Problem

Häftad, Engelska, 2020

AvHenri Lombardi,Daniel Perrucci,Marie-Francoise Roy

1 339 kr

Beställningsvara. Skickas inom 11-20 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.


The authors prove an elementary recursive bound on the degrees for Hilbert's 17th problem. More precisely they express a nonnegative polynomial as a sum of squares of rational functions and obtain as degree estimates for the numerators and denominators the following tower of five exponentials $ 2^{ 2^{ 2^{d^{4^{k}}} } } $ where $d$ is the number of variables of the input polynomial. The authors' method is based on the proof of an elementary recursive bound on the degrees for Stengle's Positivstellensatz. More precisely the authors give an algebraic certificate of the emptyness of the realization of a system of sign conditions and obtain as degree bounds for this certificate a tower of five exponentials, namely $ 2^{ 2^{\left(2^{\max\{2,d\}^{4^{k}}}+ s^{2^{k}}\max\{2, d\}^{16^{k}{\mathrm bit}(d)} \right)} } $ where $d$ is a bound on the degrees, $s$ is the number of polynomials and $k$ is the number of variables of the input polynomials.

Produktinformation

Hoppa över listan

Mer från samma författare

Hoppa över listan

Mer från samma serie

Cataland

Christian Stump, Hugh Thomas, Nathan Williams

Häftad

1 269 kr

Hoppa över listan

Du kanske också är intresserad av

  • Nyhet
Del 4

Sot

Sara Strömberg

Storpocket

139 kr179 kr

  • Nyhet
Del 4

Nattjägaren

Anders de la Motte

Storpocket

139 kr179 kr