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 Γ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(Γm∩Γm+1)=4, w(Γm+1∩Γm+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).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
