|
Organizers |
Enhancements of Counting Invariants
by
Sam Nelson
Pomona College
The number of colorings of a link diagram by finite quandle is an easily computable link invariant. We will look at a number of ways of strengthening these counting invariants for certain types of coloring quandles by exploiting the quandle's extra structure.
Paper reference: arXiv:0801.2979
Date received: March 2, 2008
Copyright © 2008 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cawt-05.