We show that all knots up to crossings can be represented by polynomial knots of degree at most , among which except for $5_2, 5_2^, 6_1, 6_1^, 6_2, 6_2^*6_3$ all are in their minimal degree representation. We provide concrete polynomial representation of all these knots. Durfee and O’Shea had asked a question: Is there any crossing knot in degree ? In this paper we try to partially answer this question. For an integer , we define a set to be the set of all polynomial knots given by such that , and . This set can be identified with a subset of and thus it is equipped with the natural topology which comes from the usual topology . In this paper we determine a lower bound on the number of path components of for . We define a path equivalence for polynomial knots in the space and show that it is stronger than the topological equivalence.

生成讲解博客的中文版本

生成AI智能校验的中文版本