Trinomial containment in polynomial ideals is undecidable

We prove that deciding whether an ideal in a polynomial ring contains a trinomial is impossible on a Turing machine. More precisely, from an integer polynomial $P$ we compute generators of an ideal $I_P$ in a polynomial ring over $\mathbb{Q}$ such that $I_P$ contains a trinomial if and only if $P$ h