Properties of minimal charts and their applications IX: charts of type $(4,3)$
Teruo Nagase, Akiko Shima

TL;DR
This paper proves that minimal charts of type (4,3), which describe certain embedded surfaces in 4-space, do not exist, advancing the understanding of surface braid representations.
Contribution
It establishes the non-existence of minimal charts of type (4,3), providing new insights into the structure of charts representing embedded surfaces.
Findings
No minimal chart of type (4,3) exists.
The result constrains possible configurations of surface braids.
Advances the classification of charts for embedded surfaces in 4-space.
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 the union of all the edges of label . A chart is of type if there exists a label such that , , where is the number of white vertices in . In this paper, we prove that there is no minimal chart of type .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Computational Geometry and Mesh Generation · Algebraic Geometry and Number Theory
