{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/widths-of-links-via-diagram-colorings","title":"Widths of links via diagram colorings","arxiv_id":"2401.17193","date":"2024-01-30","proceeding":null,"authors":["Ricky Lee","Puttipong Pongtanapaisan","Hanh Vo"],"abstract":"In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are advantageous because they are algorithmic and suitable for program implementations. As an application, we calculate the max-width of over 10000 links up to 14 crossings from the link table.","url_abs":"https://arxiv.org/abs/2401.17193v1","url_pdf":"https://arxiv.org/pdf/2401.17193v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"widths-of-links-via-diagram-colorings","repo_url":"https://github.com/hanhv/wirtinger_trunk","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}