The Delunification Process and Minimal Diagrams

Slavik Jablan; Louis Kauffman; Pedro Lopes

Home/Archive/arXiv

arXiv · 1406.2378

The Delunification Process and Minimal Diagrams

Slavik Jablan·Louis Kauffman·Pedro Lopes

View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.GT

Keep this discovery

BibTeX RIS

Slavik Jablan, Louis Kauffman, Pedro Lopes. 2014-06-09. The Delunification Process and Minimal Diagrams. https://arxiv.org/abs/1406.2378

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bar cohomology of links: beyond Milnor invariants

We develop bar cohomology of link complements as an invariant of links in homology spheres. In this setting, bar cohomology is a Hopf algebra which is calculable using surfaces and their intersection curves in a link complement. In this first in a sequence of works, we introduce the invariant and show that it defines a canonical subspace of the tensor Hopf algebra, which already encodes information about Milnor's link invariants and provides geometrically significant information beyond them.

math.GT↗

arXiv2026

A counterexample to the wrapping number conjecture

We exhibit an annular knot with wrapping number four whose Kauffman bracket has annular degree at most two. This disproves the wrapping number conjecture.

math.GT↗

arXiv2026

Homological lifts of Arnold invariants $J^-$ and $J^+$

Viro's Euler-integral polynomial $P_C(q)$ and the Lanzat--Polyak quantized-curvature polynomial $I_q(C)$ refine Arnold's invariants $J^-$ and $J^+$ for generic immersed one-component plane curves. We construct homological lifts of both. The bigraded region homology retains the singular homology of every connected Alexander-index region; its graded Euler characteristic is $P_C(q)$. The triply graded smoothing-circle homology is generated by the oriented circles of the orientation-preserving smoothing and decategorifies to the smoothing term in $I_q(C)$. Keeping the actual region summands and the boundary regions of every smoothing circle gives a homological refinement of the oriented smoothing configuration, or Seifert state. An infinite family proves strictness: both polynomial data and the ordinary homological lifts agree, while the component-graded region homology and the branch-decomposed circle homology distinguish every pair. Further constructions recover the full $I_q(C)$ by a vertex complex, realize the local change of its curvature integral by edge homology, and give a canonical two-state homology for unoriented curves. Viro described his Euler-integral formula as an analogue of face state-sum formulas for quantum knot polynomials. Through the categorifications developed here, we obtain one concrete homological face-state-sum model realizing that analogy.

math.GT↗