The polynomial
$$f(x,y) = \begin{bmatrix} (x^2-y^2)(y(4x^2-1)+2) \\ 2xy(y(4x^2-1)+2) \\ x^3-3xy^2 \end{bmatrix} $$
maps the circle $\left\{ (x, y) \mid x^2 + y^2 = 1 \right\}$ to a trefoil knot, and I suspect that this is the lowest degree polynomial that can map the circle to a nontrivial knot- i.e. that there are no degree $4$ polynomials that can map the circle to a knot. However after significant thought I have no idea how to approach proving this. With the stick number, which feels analogous, it is possible to reduce the problem of $n=4$ or $5$ to finitely many cases, but that doesn't seem possible here.
I would like either a proof or a method of approaching a proof for this. I would also appreciate a way of proving that this is the lowest degree polynomial that produces a trefoil knot, which I am equally stumped by.
It seems natural that degree $5$ would be minimal as the trefoil knot is the simplest knot and is the $(3,2)$ torus knot, but I have no deeper reasoning besides that it feels like with lower degree polynomials you can't fit enough bends in.
The way I produced this polynomial was starting with a this parameterisation of the trefoil knot and expanding for example $\sin 3\theta = 4 \sin \theta \cos^2 \theta - \sin \theta$ so the formula is all in terms of $\cos \theta$ and $\sin \theta$, which for the circle are just $x$ and $y$.
Edit: apparently there is a degree $3$ polynomial that works, so now the objective is to prove no degree $2$ polynomials work- hopefully that's more tractable.