Please use this identifier to cite or link to this item:
http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3359
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Raundal, Hitesh | en_US |
dc.contributor.author | MISHRA, RAMA | en_US |
dc.date.accessioned | 2019-07-01T05:37:44Z | |
dc.date.available | 2019-07-01T05:37:44Z | |
dc.date.issued | 2017-03 | en_US |
dc.identifier.citation | Topology and its Applications, 218, 66-92. | en_US |
dc.identifier.issn | 0166-8641 | en_US |
dc.identifier.issn | 0166-8641 | en_US |
dc.identifier.uri | http://dr.iiserpune.ac.in:8080/xmlui/handle/123456789/3359 | - |
dc.identifier.uri | https://doi.org/10.1016/j.topol.2016.12.020 | en_US |
dc.description.abstract | In this paper we study the topology of three different kinds of spaces associated to polynomial knots of degree at most d, for d >= 2. We denote these spaces by O-d,O- P-d and Q(d). For d >= 3, we show that the spaces O-d and T-d are path connected and the space O-d has the same homotopy type as S-2. Considering the space P = boolean OR(d >= 2) O-d of all polynomial knots with the inductive limit topology, we prove that it to has the same homotopy type as S-2. We also show that if two polynomial knots are path equivalent in Q(d), then they are topologically equivalent. Furthermore, the number of path components in Q(d) are in multiples of eight. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Elsevier B.V. | en_US |
dc.subject | Polynomial knot | en_US |
dc.subject | Polynomial representation | en_US |
dc.subject | Homotopy | en_US |
dc.subject | Isotopy | en_US |
dc.subject | 2017 | en_US |
dc.title | Some spaces of polynomial knots | en_US |
dc.type | Article | en_US |
dc.contributor.department | Dept. of Mathematics | en_US |
dc.identifier.sourcetitle | Topology and its Applications | en_US |
dc.publication.originofpublisher | Foreign | en_US |
Appears in Collections: | JOURNAL ARTICLES |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.