Paperlane

no. 16 · Tuesday 17 November 2026

The linear minimal 4-chart with three crossings

Teruo Nagase and Akiko Shima

math.GT · v4 · 39 pp

Abstract

Charts are oriented labeled graphs in a disk. Every simple surface braid ($2$-dimensional braid) can be described by a chart. Moreover, a chart represents an oriented closed surface embedded in four-space. In this paper, we study such embedded surfaces using charts. Let $Γ$ be a chart. Let ${\rm Cross}(Γ)$ denote the set of all the crossings of $Γ$, and let $Γ_m$ denote the union of all the edges of label $m$. A 4-chart $Γ$ is said to be ${\it linear}$ if every connected component of $$(Γ_1\cup Γ_3)-{\rm Cross}(Γ)$$ is acyclic. In this paper, we prove that after deleting free edges and hoops, every linear minimal $4$-chart with three crossings is lor-equivalent (equivalent under label changes, orientation reversals, and reflections) to the chart describing a $2$-twist-spun trefoil knot.

comments
39 pages, 37 figures
fields
Geometric Topology
pdf ↗ page arXiv:2509.04114 ↗