Papers
Topics
Authors
Recent
Search
2000 character limit reached

Crossing Number Bound in Knot Mosaics

Published 29 May 2014 in math.GT | (1405.7683v3)

Abstract: Knot mosaics are used to model physical quantum states. The mosaic number of a knot is the smallest integer $m$ such that the knot can be represented as a knot $m$-mosaic. In this paper we establish an upper bound for the crossing number of a knot in terms of the mosaic number. Given an $m$-mosaic and any knot $K$ that is represented on the mosaic, its crossing number $c$ is bounded above by $(m - 2){2} - 2$ if $m$ is odd, and $(m - 2){2} - (m - 3)$ if $m$ is even.

Authors (2)
Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.