Abstract
A method of representing knots, links, and singular knots and links by words in a finite alphabet and so-called d-diagrams is given. A representation of the chord diagram algebra by words in a finite alphabet is considered. This method, unlike coding by Gauss diagrams, allows one to consider knots and links simultaneously. An algorithm for recognition of diagrams of classical knots in terms of d-diagrams is given. Bibliography: 9 titles.
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.
