The Incredibly Knotty Checkerboard Challenge

From MaRDI portal





The author reduces a problem involving a positive knot diagram to consideration of a trip matrix, which allows one to obtain the Jones polynomial for the knot directly from the matrix. The problem in turn can be interpreted as a puzzle on a checkerboard where one covers vertices with coins in particular patterns and raises the question of whether by covering certain columns, one can be sure that each row has an even number of visible coins in the remaining positions in each row.











This page was built for publication: The Incredibly Knotty Checkerboard Challenge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3153885)