Show simple item record

dc.contributor.authorAmundsen, Jonah
dc.contributor.authorGuyer, Daniel
dc.contributor.authorAnderson, Eric
dc.contributor.authorDavis, Christopher
dc.date.accessioned2020-01-03T20:22:00Z
dc.date.available2020-01-03T20:22:00Z
dc.date.issued2019-05
dc.identifier.urihttp://digital.library.wisc.edu/1793/79556
dc.descriptionColor poster with text, images, and formulas.en_US
dc.description.abstractIn knot theory, a link is a disjoint union of circles (i.e. components) in 3-dimensional space. A goal of knot theory is to measure the interaction between the various components of a link. One measure of the complexity of a link is the complexity of a 2-dimensional object bounded by this link. One such object is a Ccomplex (or clasp-complex). We ask the question, “Given a link, what is the least number of clasps amongst all C-complexes bounded by that link?” For two-component links, we have found a precise formula for the minimal number of clasps. In the case of links of three components, we prove a bound in terms of a generalization of the classical linking number called the triple linking number, by relating this problem to minimal perimeter polyominoes.en_US
dc.description.sponsorshipUniversity of Wisconsin--Eau Claire Office of Research and Sponsored Programsen_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesUSGZE AS589;
dc.subjectComponent theoremen_US
dc.subjectKnot theoryen_US
dc.subjectPostersen_US
dc.titleMinimal Complexity of C-Complexesen_US
dc.typePresentationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • Student Research Day
    Posters of collaborative student/faculty research presented at Student Research Day

Show simple item record