Quantum knot mosaics and the growth constant
From MaRDI portal
Publication:306164
DOI10.1016/J.TOPOL.2016.08.011zbMATH Open1347.81034arXiv1609.00517OpenAlexW2962929189MaRDI QIDQ306164FDOQ306164
Authors: Seungsang Oh
Publication date: 31 August 2016
Published in: Topology and its Applications (Search for Journal in Brave)
Abstract: Lomonaco and Kauffman introduced a knot mosaic system to give a precise and workable definition of a quantum knot system, the states of which are called quantum knots. This paper is inspired by an open question about the knot mosaic enumeration suggested by them. A knot --mosaic is an array of 11 mosaic tiles representing a knot or a link diagram by adjoining properly that is called suitably connected. The total number of knot --mosaics is denoted by which is known to grow in a quadratic exponential rate. In this paper, we show the existence of the knot mosaic constant and prove that 4 leq delta leq frac{5+ sqrt{13}}{2} (approx 4.303).
Full work available at URL: https://arxiv.org/abs/1609.00517
Recommendations
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)
Cites Work
Cited In (8)
- Maximal independent sets on a grid graph
- Growth rate of quantum knot mosaics
- Enumeration on graph mosaics
- Period and toroidal knot mosaics
- Upper bound on the total number of knot \(n\)-mosaics
- Quantum knots and the number of knot mosaics
- Quantum knot mosaics and bounds of the growth constant
- State matrix recursion method and monomer-dimer problem
This page was built for publication: Quantum knot mosaics and the growth constant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q306164)