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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.