All Questions

There are a number of criteria for determining whether a polynomial $\in \mathbb{Z} [X]$ is irreducible over $\mathbb{Q}$ (the traditional ones being Eisenstein criterion and irreducibility over a ...

By a decomposition of a polynomial $F(x)$ over a field $K$ we mean writing $F(x)$ as $$ F(x)=G(H(x)) \quad(G(x), H(x) \in K[x]), $$ which is nontrivial if $\operatorname{deg} G(x)>1$ and $\...

Let a finite collection of (complex) unknowns $\{x_1,\ldots,x_n\}$ be given, as well as an affine system $AX=B$ in the quadratic variables $X:=[x_i x_j : i\leq j]$, with entries in a computable ...