|
Organizers |
Unknotting number and unlinking gap
by
Radmila Sazdanovic
The George Washington University
Coauthors: Slavik Jablan
Computing unlinking number is a very difficult and complex problem. Therefore we define BJ-unlinking number and BJ-unlinking gap which will be computable due to the algorithmic nature of their definition. According to Bernhard-Jablan conjecture unknotting/unlinking number is the same as the BJ- unlinking number. We compute BJ-unlinking number for various families of knots and links for which the unlinking number is unknown and give experimental results for families of rational links with arbitrarily large BJ-unlinking gap and polyhedral links with constant non-trivial BJ-unlinking gap.
Date received: April 13, 2007
Copyright © 2007 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 # cauq-17.