Abstract
The problem concerning which Gauss diagrams can be realized by knots is an old one and has been solved in several ways. In this paper, we present a direct approach to this problem. We show that the needed conditions for realizability of a Gauss diagram can be interpreted as follows “the number of exits = the number of entrances” and the sufficient condition is based on the Jordan curve theorem. Further, using matrices, we redefine conditions for realizability of Gauss diagrams and then we give an algorithm to construct meanders.
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.
