Enumeration on graph mosaics

DOI10.1142/S0218216517500328zbMATH Open1440.05119arXiv1703.04868MaRDI QIDQ5269130FDOQ5269130

Seungsang Oh, Kyungpyo Hong

Publication date: 15 June 2017

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Abstract: Since the Jones polynomial was discovered, the connection between knot theory and quantum physics has been of great interest. Lomonaco and Kauffman introduced the knot mosaic system to give a definition of the quantum knot system that is intended to represent an actual physical quantum system. Recently the authors developed an algorithm producing the exact enumeration of knot mosaics, which uses a recursion formula of state matrices. As a sequel to this research program, we similarly define the (embedded) graph mosaic system by using sixteen graph mosaic tiles, representing graph diagrams with vertices of valence 3 and 4. And we extend the algorithm to produce the exact number of all graph mosaics. The magnified state matrix that is an extension of the state matrix is mainly used.

Full work available at URL: https://arxiv.org/abs/1703.04868

zbMATH Keywords

knot mosaicquantum knotgraph mosaic

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99) Enumeration in graph theory (05C30) Generalized knots (virtual knots, welded knots, quandles, etc.) (57K12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial invariant for knots via von Neumann algebras
• Hecke algebra representations of braid groups and link polynomials
• Estimating Jones polynomials is a complete problem for one clean qubit
• Quantum knots and the number of knot mosaics
• Small knot mosaics and partition matrices
• Quantum knot mosaics and the growth constant
• Upper bound on the total number of knot n-mosaics
• Mosaic number of knots
• Quantum knots and mosaics
• Knots and physics
• Enumerating independent vertex sets in grid graphs

Cited In (6)

• Maximal independent sets on a grid graph
• Growth rate of quantum knot mosaics
• Quantum knots and the number of knot mosaics
• Quantum knot mosaics and bounds of the growth constant
• Domino tilings of the expanded Aztec diamond
• State matrix recursion method and monomer-dimer problem

This page was built for publication: Enumeration on graph mosaics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269130)