The delunification process and minimal diagrams

DOI10.1016/J.TOPOL.2015.07.010MaRDI QIDQ492265zbMATH OpenOpenAlexFDO

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

Publication date 20 August 2015

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

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

zbMATH Keywords

coloringslinksgrey setslune-free crossing numberslune-free diagrams

Mathematics Subject Classification ID

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.

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

Cites work

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

Cited in

(7)

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

Describes a project that uses

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)