Spaces of polynomial knots in low degree

From MaRDI portal
Publication:3465792




Abstract: We show that all knots up to 6 crossings can be represented by polynomial knots of degree at most 7, among which except for 52,52,61,61,62,62 and 63 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 5 crossing knot in degree 6? In this paper we try to partially answer this question. For an integer dgeq2, we define a set mathcalildePd to be the set of all polynomial knots given by such that extdeg(f)=d2, extdeg(g)=d1 and extdeg(h)=d. This set can be identified with a subset of mathbbR3d and thus it is equipped with the natural topology which comes from the usual topology mathbbR3d. In this paper we determine a lower bound on the number of path components of mathcalildePd for dleq7. We define a path equivalence for polynomial knots in the space mathcalildePd and show that it is stronger than the topological equivalence.









This page was built for publication: Spaces of polynomial knots in low degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465792)