An Elementary Recursive Bound for Effective Positivstellensatz and Hilbert's 17th Problem (Paperback)

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.

General

Imprint:	American Mathematical Society
Country of origin:	United States
Series:	Memoirs of the American Mathematical Society
Release date:	October 2020
Authors:	Henri Lombardi • Daniel Perrucci • Marie-Francoise Roy
Dimensions:	254 x 178mm (L x W)
Format:	Paperback
Pages:	113
ISBN-13:	978-1-4704-4108-1
Categories:	Books > Science & Mathematics > Mathematics > Algebra > General Books > Science & Mathematics > Mathematics > Geometry > Algebraic geometry Promotions
LSN:	1-4704-4108-X
Barcode:	9781470441081

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!