An übercrossing diagram is a knot diagram with only one crossing that may involve
more than two strands of the knot. Such a diagram without any nested
loops is called a petal projection. Every knot has a petal projection from
which the knot can be recovered using a permutation that represents strand
heights. Using this permutation, we give an algorithm that determines the
-colorability
and the determinants of knots from their petal projections. In particular, we
compute the determinants of all prime knots with crossing number less than
from
their petal permutations.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.205
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.