On upper bounds for toroidal mosaic numbers
From MaRDI portal
Publication:370992
Abstract: In this paper, we work to construct mosaic representations of knots on the torus, rather than in the plane. This consists of a particular choice of the ambient group, as well as different definitions of contiguous and suitably connected. We present conditions under which mosaic numbers might decrease by this projection, and present a tool to measure this reduction. We show that the order of edge identification in construction of the torus sometimes yields different resultant knots from a given mosaic when reversed. Additionally, in the Appendix we give the catalog of all 2 by 2 torus mosaics.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1092415 (Why is no real title available?)
- scientific article; zbMATH DE number 907055 (Why is no real title available?)
- A polynomial quantum algorithm for approximating the Jones polynomial
- Estimating Jones polynomials is a complete problem for one clean qubit
- Knots and physics
- Quantum knots and mosaics
- Quantum knots and mosaics
- q-DEFORMED SPIN NETWORKS, KNOT POLYNOMIALS AND ANYONIC TOPOLOGICAL QUANTUM COMPUTATION
Cited in
(4)
This page was built for publication: On upper bounds for toroidal mosaic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q370992)