Home
»
Elementary Recursive Bound for Effective Positivstellensatz and Hilbert's 17th Problem
Elementary Recursive Bound for Effective Positivstellensatz and Hilbert's 17th Problem
Regular price
€85.99
Regular price
€88.99
Sale
Sale price
€85.99
603 verified reviews
100% verified
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
A01=Daniel Perrucci
A01=Henri Lombardi
A01=Marie-Francoise Roy
Age Group_Uncategorized
Age Group_Uncategorized
Author_Daniel Perrucci
Author_Henri Lombardi
Author_Marie-Francoise Roy
automatic-update
Category1=Non-Fiction
Category=PBF
Category=PBMW
COP=United States
Delivery_Delivery within 10-20 working days
eq_isMigrated=0
eq_isMigrated=2
eq_nobargain
Language_English
PA=Available
Price_€50 to €100
PS=Active
softlaunch
Product details
- ISBN 9781470441081
- Weight: 252g
- Dimensions: 178 x 254mm
- Publication Date: 30 Apr 2020
- Publisher: American Mathematical Society
- Publication City/Country: US
- Product Form: Paperback
- Language: English
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.
Henri Lombardi, Universite de Franche-Comte, Besancon, France
Daniel Perrucci, Universidad de Buenos Aires, Argentina
Marie-Francoise Roy, Universite de Rennes, France
Daniel Perrucci, Universidad de Buenos Aires, Argentina
Marie-Francoise Roy, Universite de Rennes, France
Elementary Recursive Bound for Effective Positivstellensatz and Hilbert's 17th Problem
€85.99
