[Paper Review] An alternating labeling on a spanning tree of Seifert graphs and applications in knot theory

Dong‐Seok Kim|arXiv (Cornell University)|Aug 6, 2011

Geometric and Algebraic Topology37 references3 citations

TL;DR

This paper introduces an alternating labeling system on spanning trees of Seifert graphs to analyze flat plumbing baskets in knot theory. By classifying edges in the graph based on their contribution to flat plumbing operations—requiring one or three plumbings depending on edge type—it establishes a precise count of flat plumbing baskets needed to represent a given knot or link, providing a new invariant for knot classification.

ABSTRACT

The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link. Consequently, we define the basket number, flat plumbing number and flat plumbing basket number of a link. Then we provide several upper bounds for these plumbing numbers and study the relation between these plumbing numbers and the genera of links.

Motivation & Objective

• To develop a labeling system on spanning trees of Seifert graphs for knot invariants.
• To classify edges in the graph based on their contribution to flat plumbing operations.
• To determine the minimal number of flat plumbings required to represent a knot or link.
• To establish a new invariant for knots using the flat plumbing basket number derived from the labeling.

Proposed method

• An alternating labeling is applied to edges of a spanning tree in a Seifert graph.
• Edges are partitioned into sets: Ψ(T), Υ(T), and Φ(T), based on their role in the plumbing structure.
• For each edge e ∈ Ψ(T), |Γ(e)| + 1 flat plumbings are required.
• For edges in E(T) − Ψ(T), one co-tree edge ¯e ∈ Γ(e) ∩ Υ(T) contributes to the plumbing count.
• Edges in Γ(e) ∩ (E(Ψ(T)) ∪ Υ(T))^c require one flat plumbing each.
• Edges in Φ(T) require three flat plumbings, with two used to flip the sign of ϕ(f).

Experimental results

Research questions

• RQ1 How can an alternating labeling on a spanning tree of a Seifert graph be used to compute the flat plumbing basket number of a knot?
• RQ2 What is the minimal number of flat plumbings required for different edge types in the Seifert graph?
• RQ3 How do the classifications of edges (e.g., in Φ(T) vs. E(Γ) − (E(Γ(T)) ∪ Φ(T))) affect the plumbing count?
• RQ4 Can the labeling system produce a complete invariant for knots based on flat plumbing basket operations?
• RQ5 What role do sign changes in ϕ(f) play in determining the number of required plumbings?

Key findings

• Edges in Ψ(T) require |Γ(e)| + 1 flat plumbings, directly linking edge structure to plumbing complexity.
• Edges in E(T) − Ψ(T) contribute via a single co-tree edge ¯e ∈ Γ(e) ∩ Υ(T), reducing plumbing count.
• Edges in Γ(e) ∩ (E(Ψ(T)) ∪ Υ(T))^c require only one flat plumbing each.
• Edges in Φ(T) require three flat plumbings, with two used to reverse the sign of ϕ(f).
• For edges f ∈ E(Γ) − (E(Γ(T)) ∪ Φ(T)), only one flat plumbing is needed, as ν(f) differs from ϕ(f).
• The total number of flat plumbings is computed by summing contributions across all edge types, yielding a precise count for the flat plumbing basket number.