The linear minimal 4-chart with three crossings

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 Cross() the set of all the crossings of , and we denote by m the union of all the edges of label m. For a 4-chart , if each connected component of the set (1 3)-Cross() is acyclic, then is said to be linear. In this paper, we shall show that any linear minimal 4-chart with three crossings is lor-equivalent (Label-Orientation-Reflection equivalent) to the chart describing a 2-twist spun trefoil knot by omitting free edges and hoops.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…