Minimal Complexity C-complexes for Colored Links

dc.contributor.advisorDavis, Christopher
dc.contributor.authorRoth, Grant
dc.date.accessioned2016-04-13T16:20:49Z
dc.date.available2016-04-13T16:20:49Z
dc.date.issued2015-04
dc.descriptionColor poster with text and images.en
dc.description.abstractIn this project, we study the analogous measure of complexity given by a generalization of a surface called a C-complex.en
dc.description.sponsorshipBlugold Commitment; University of Wisconsin--Eau Claire Office of Research and Sponsored Programsen
dc.identifier.urihttp://digital.library.wisc.edu/1793/74758
dc.language.isoen_USen
dc.relation.ispartofseriesUSGZE AS589en
dc.subjectC-complexen
dc.subjectLinksen
dc.subjectMathematicsen
dc.subjectPostersen
dc.titleMinimal Complexity C-complexes for Colored Linksen
dc.typePresentationen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
RothSpr15.pdf
Size:
246.24 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.03 KB
Format:
Item-specific license agreed upon to submission
Description: