Abstract
We show that all knots up to crossings can be represented by polynomial knots of degree at most , among which except for and 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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.