{"paper":{"title":"Crossing Number Bound in Knot Mosaics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Andrew Kobin, Hugh Howards","submitted_at":"2014-05-29T19:53:26Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7683","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}