Abstract
For an oriented knot diagram, we define a cyclic word in letters [Formula: see text] and [Formula: see text] corresponding to positive and negative crossings along the diagram, respectively. We give a necessary and sufficient condition for a cyclic word in [Formula: see text] and [Formula: see text] to be obtained from some knot diagram. Also, we prove that any PN sequence of a diagram of a nontrivial knot contains at least four subsequences [Formula: see text] and [Formula: see text].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
