Enumeration on graph mosaics
- Authors
- Hong, Kyungpyo; Oh, Seungsang
- Issue Date
- 4월-2017
- Publisher
- WORLD SCIENTIFIC PUBL CO PTE LTD
- Keywords
- Quantum knot; knot mosaic; graph mosaic
- Citation
- JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, v.26, no.5
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS
- Volume
- 26
- Number
- 5
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/84058
- DOI
- 10.1142/S0218216517500328
- ISSN
- 0218-2165
- 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 16 graph mosaic tiles, representing graph diagrams with vertices of valence 3 and 4. 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Science > Department of Mathematics > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.