Bounding Crossing Number in Rectangular and Hexagonal Knot Mosaics
Hugh Howards, Jiong Li, Xiaotian Liu

TL;DR
This paper extends existing bounds on the crossing number of knots from rectangular mosaics to hexagonal mosaics, providing new bounds and simplified proofs across different mosaic settings.
Contribution
It introduces a new upper bound for the crossing number in hexagonal mosaics and simplifies the proof for rectangular mosaics, advancing knot mosaic theory.
Findings
New upper bound for hexagonal knot mosaics crossing number
Simplified proof for rectangular mosaic crossing bounds
Extension of bounds to all three natural settings
Abstract
Howards and Kobin give a sharp upper bound for crossing number of knots on rectangular mosaics. Here we extend the proof to create a new bound for hexagonal mosaics in all three natural settings and shorten the proof in the rectangular setting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDigital Image Processing Techniques · Computational Geometry and Mesh Generation · 3D Shape Modeling and Analysis
