{"paper":{"title":"Upper bound on the total number of knot $n$-mosaics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Ho Lee, Hwa Jeong Lee, Kyungpyo Hong, Seungsang Oh","submitted_at":"2013-03-28T06:02:21Z","abstract_excerpt":"Lomonaco and Kauffman introduced a knot mosaic system to give a definition of a quantum knot system which can be viewed as a blueprint for the construction of an actual physical quantum system. A knot $n$-mosaic is an $n \\times n$ matrix of 11 kinds of specific mosaic tiles representing a knot or a link by adjoining properly that is called suitably connected. $D_n$ denotes the total number of all knot $n$-mosaics. Already known is that $D_1=1$, $D_2=2$, and $D_3=22$. In this paper we establish the lower and upper bounds on $D_n$ $$\\frac{2}{275}(9 \\cdot 6^{n-2} + 1)^2 \\cdot 2^{(n-3)^2} \\ \\leq \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7044","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"}