The delunification process and minimal diagrams

DOI10.1016/J.TOPOL.2015.07.010zbMATH Open1322.57012arXiv1406.2378OpenAlexW1086352554MaRDI QIDQ492265FDOQ492265

Authors: S. V. Jablan, Louis Kauffman, Pedro Lopes 

Publication date: 20 August 2015

Published in: Topology and its Applications (Search for Journal in Brave)

Abstract: A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same number of colors. Thus any colored link diagram with a minimum number of colors (known as a minimal diagram) is equivalent to a colored lune-free diagram with that same number of colors. We call the passage from a link diagram to an equivalent lune-free diagram its delunification process. We then introduce a notion of grey sets in order to obtain higher lower bounds for minimum number of colors. We calculate these higher lower bounds for a number of prime moduli with the help of computer programs. For each number of crossings through 16, we list the lune-free diagrams and we color them. If the number of colors equals the corresponding higher lower bound we know we have a minimum number of colors. We also introduce and list the lune-free crossing number of a link i.e., the minimum number of crossings needed for a lune-free diagram of this link, and other related link invariants.

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

Recommendations

• Minimal hard surface-unlink and classical unlink diagrams
• Minimality in diagrams of simplicial sets
• On overlays and minimization diagrams
• Hopf plumbing and minimal diagrams
• Confluence by decreasing diagrams -- formalized
• Decreasing diagrams for confluence and commutation
• Discrete minification processes and reversibility
• Deformations of diagrams
• Graph minors and the linear reducibility of Feynman diagrams

zbMATH Keywords

coloringslinksgrey setslune-free crossing numberslune-free diagrams

Mathematics Subject Classification ID

Cites Work

• Title not available (Why is that?)
• A classifying invariant of knots, the knot quandle
• DISTRIBUTIVE GROUPOIDS IN KNOT THEORY
• Virtual knot theory
• LUNE-FREE KNOT GRAPHS
• Title not available (Why is that?)
• A proof of the Kauffman-Harary conjecture
• Knots and graphs. I: Arc graphs and colorings
• On the minimum number of colors for knots
• The minimum number of Fox colors and quandle cocycle invariants
• MINIMUM NUMBER OF FOX COLORS FOR SMALL PRIMES
• Minimum number of colors: the Turk's head knots case study
• QUANDLES AT FINITE TEMPERATURES I
• Title not available (Why is that?)
• The Teneva game
• Equivalence classes of colorings
• The minimization of the number of colors is different at p = 11
• AUTOMORPHISM GROUPS OF QUANDLES
• LinKnot. Knot theory by computer
• Any 7-colorable knot can be colored by four colors
• 5-colored knot diagram with four colors

Cited In (7)

• LUNE-FREE KNOT GRAPHS
• The minimum number of Fox colors modulo 13 is 5
• Minification processes and their transformations
• Removing colors 2k, 2k − 1, and k
• Delta diagrams
• Preface: Remembering Slavik Jablan
• Remembrance: Slavik Jablan (1952--2015)

Uses Software

• OEIS
• plantri

This page was built for publication: The delunification process and minimal diagrams

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