On algorithms for testing positivity of symmetric polynomial functions

Abstract: We show that positivity on

m a t h b b R_{+}^{n}

and on

m a t h b b R^{n}

of real symmetric polynomials of degree at most

p

in

n g e 2

variables is solvable by algorithms running in

m a t h r m p o l y (n)

time. For real symmetric quartics, we find explicit discriminants and related Maple algorithms running in

m a t h r m l i n (n)

time.

This page was built for publication: On algorithms for testing positivity of symmetric polynomial functions