Linear Chord Diagrams with Long Chords, Thesis Defence by Everett Sullivan
A linear chord diagram of size n is a partition of the first 2n integers into sets of size two.
Location
Haldeman 41 (Kreindler Conference Hall)
Sponsored by
Mathematics Department
Audience
Public
A linear chord diagram of size n is a partition of the first 2n integers into sets of size two.
These diagrams appear in many different contexts in combinatorics and other areas of mathematics, particularly knot theory.
We explore various constraints that produces diagrams which have many longs chords.
A number of patterns appear from the results of these constraints which we can prove using techniques ranging from explicit bijections to non-commutative algebra.
Location
Haldeman 41 (Kreindler Conference Hall)
Sponsored by
Mathematics Department
Audience
Public
