Tree Diagrams for String Links
Blake Mellor

TL;DR
This paper classifies the tree structures that can be realized as intersection graphs of string link diagrams, advancing the understanding of their combinatorial properties in the context of finite type invariants.
Contribution
It provides a complete classification of trees that serve as intersection graphs for string link diagrams, a novel result in the study of finite type invariants.
Findings
Identifies all possible trees that can be intersection graphs of string links.
Establishes criteria for when a tree can be realized as an intersection graph.
Contributes to the combinatorial understanding of string link invariants.
Abstract
In previous work, the author defined the intersection graph of a chord diagram associated with string links (as in the theory of finite type invariants). In this paper, we classify the trees which can be obtained as intersection graphs of string link diagrams.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · semigroups and automata theory · Advanced Combinatorial Mathematics
