Enumeration on graph mosaics

DOI10.1142/S0218216517500328zbMath1440.05119arXiv1703.04868MaRDI QIDQ5269130

Seungsang Oh, Kyungpyo Hong

Publication date: 15 June 2017

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

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

zbMATH Keywords

knot mosaicquantum knotgraph mosaic

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

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

This page was built for publication: Enumeration on graph mosaics