Properties of minimal charts and their applications IX: charts of type (4,3)
Abstract
Charts are oriented labeled graphs in a disk. Any simple surface braid (2-dimensonal 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 m the union of all the edges of label m. A chart is of type (4,3) if there exists a label m such that w()=7, w(mm+1)=4, w(m+1m+2)=3 where w(G) is the number of white vertices in G. In this paper, we prove that there is no minimal chart of type (4,3).
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.