The linear minimal 4-chart with three crossings
Geometric Topology
2026-05-01 v3
Abstract
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensional braid) can be described by using a chart. Also, a chart represents an oriented closed surface embedded in 4-space. In this paper, we investigate embedded surfaces in 4-space by using charts. Let be a chart, and we denote by the set of all the crossings of , and we denote by the union of all the edges of label . For a 4-chart , if each connected component of the set is acyclic, then is said to be {\it linear}. In this paper, we shall show that any linear minimal -chart with three crossings is lor-equivalent (Label-Orientation-Reflection equivalent) to the chart describing a -twist spun trefoil knot by omitting free edges and hoops.
Cite
@article{arxiv.2509.04114,
title = {The linear minimal 4-chart with three crossings},
author = {Teruo Nagase and Akiko Shima},
journal= {arXiv preprint arXiv:2509.04114},
year = {2026}
}
Comments
37 pages, 34 figures