Abstract
We study the relationship between reduction operations on link diagrams and S-graphs associated with them. We are motivated by the problem of computing the braid index of a link and some well known conjectures concerning the braid index of a link and the writhe of its diagrams. Possible counterexamples are discussed in terms of both S-graphs and link diagrams. We also indicate the relation of S-graphs to singular links regarded up to an appropriate equivalence relation.
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.
