Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
2 answers
742 views

Polynomials that preserve nonnegativity

A polynomial $p \in \mathbb{R}[x_1,\dots,x_n]$ is said to be positive on a subset $S$ of $\mathbb{R}^n$ if $p(x) > 0$ for every $x \in S$. The polynomial $p$ is called nonnegative if $p(x) \ge 0$ ...
Pietro Paparella's user avatar
5 votes
1 answer
169 views

Connectedness of semialgebraic sets via CAD

I do not know whether there is a standard or some traditional ways to decide whether a semialgebraic set is connected or not. One way I know is the cylindrical algebraic decomposition (CAD) algorithm. ...
user91646's user avatar