On charts with two crossings. I: There exist no NS-tangles in a minimal chart
type: Item
instance of: scholarly article
zbMATH Open document ID: 1250.57039
author: Teruo Nagase
author: Akiko Shima
publication date: 2012-08-20T00:00:00Z
Mathematics Subject Classification ID: 57Q45
Mathematics Subject Classification ID: 57Q35
zbMATH DE Number: 6068655
zbMATH Keywords: surface link
zbMATH Keywords: surface braid
zbMATH Keywords: minimal chart
MaRDI profile type: Publication
Recommended article: On charts with two crossings II
Recommended article: Properties of minimal charts and their applications. III
Recommended article: THE CLOSURES OF SURFACE BRAIDS OBTAINED FROM MINIMAL n-CHARTS WITH FOUR WHITE VERTICES
Recommended article: Properties of minimal charts and their applications. II
Recommended article: Q5437868
Recommended article: Q5464248
Recommended article: Any chart with at most one crossing is a ribbon chart
Recommended article: MINIMAL n-CHARTS WITH FOUR WHITE VERTICES
Recommended article: Minimal charts
Recommended article: The structure of a minimal \(n\)-chart with two crossings. II. Neighbourhoods of \(\Gamma _1\cup \Gamma _{n-1}\)
title: On charts with two crossings. I: There exist no NS-tangles in a minimal chart
published in: Journal of Mathematical Sciences. University of Tokyo
review text: The notion of a chart was introduced by \textit{S. Kamada} [J. Knot Theory Ramifications 1, No. 2, 137--160 (1992; Zbl 0763.57013)] as a method to present a surface braid in 4-space. A chart is an oriented and labeled graph in a disk satisfying certain conditions, with vertices of degree 1 (black vertices), degree 4 (crossings) and degree 6 (white vertices). For two charts, their presenting surface braids are equivalent if and only if the charts are C-move equivalent i.e. they are related by local modifications called C-moves; see \textit{S. Kamada} [J. Knot Theory Ramifications 5, No. 4, 517--529 (1996; Zbl 0889.57011)]. The extended complexity of a chart \(\Gamma\) is the triple \((w(\Gamma), -f(\Gamma), -b(\Gamma))\), where \(w(\Gamma)\) is the number of white vertices in \(\Gamma\), \(f(\Gamma)\) is the number of the edges in \(\Gamma\) whose endpoints are black vertices, and \(b(\Gamma)\) is the number of particular areas called bigons in \(\Gamma\). A \(k\)-minimal chart is a chart whose extended complexity is minimal among its C-move equivalent charts with at most \(k\) crossings, with respect to the lexicographic order.NEWLINENEWLINEIn this paper, the authors establish methods to count crossings and terminal edges in \(k\)-minimal charts (Theorems 3.5, 4.8, 5.4). Here, a terminal edge is an edge whose endpoints are a white vertex and a black vertex. The title is given from Theorem 3.5 which shows that there does not exist any partial graph called NS-tangle in a \(k\)-minimal chart. These theorems are used in part II of this paper (unpublished), in which the authors prove the following: For a chart \(\Gamma\) with at most two crossings, if the closure of the surface braid represented by \(\Gamma\) is a disjoint union of spheres, then \(\Gamma\) is a ribbon chart.
reviewed by: Inasa Nakamura
description: scientific article; zbMATH DE number 6068655