The structure of a minimal n-chart with two crossings. II. Neighbourhoods of _1 _n-1

DOI10.1007/S13398-018-0573-1MaRDI QIDQ2317528zbMATH OpenOpenAlexWikidataFDO

Authors Teruo Nagase, Akiko Shima

Publication date 12 August 2019

Published in Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.08827

zbMATH Keywords

chartcrossingsurface link

Mathematics Subject Classification ID

Embeddings and immersions in PL-topology (57Q35)

Abstract: Given a 2-crossing minimal chart $Gamma$, a minimal chart with two crossings, set $$there exists an edge of label $i$ containing a white vertex$$, and $$there exists an edge of label $i$ containing a white vertex$$. In this paper we study the structure of a neighbourhood of $$, and propose a normal form for 2-crossing minimal $n$-charts, here $Gamm{a}_{a}lpha$ and $$ mean the union of all the edges of label $alpha$ and $$ respectively.

Review text

Part I of this paper appeared in [J. Knot Theory Ramifications 27, No. 14, Article ID 1850078, 37 p. (2018; Zbl 1408.57025)]. Part II is the subject of the present paper. Both parts (in the PL or the smooth category) investigate the structure of minimal \(n\)-charts (or braids of degree \(n\)) with two crossings. A chart \(\Gamma\) is an oriented graph in a disk \(D^2\) with three kinds of vertices called black vertices, crossings and white vertices. The numbers of white vertices, resp., free edges, and crossings, determine different types of complexity of the chart \(\Gamma\) defining the notion of a minimal chart. From a chart we can construct a closed surface so the purpose of these investigations is a classification of surface links by using charts. For \(\Gamma \subset D^2\) and \(D \subset D^2\) a disk we have a pair \((\Gamma \cap D,D)\) called a tangle provided \(\partial D\) does not contain vertices, an edge of \(\Gamma\) intersects \(\partial D\) transversally and \(\Gamma \cap D \neq \emptyset\). Using this the authors split a minimal chart with two crossings into two kind of tangles: a net-tangle and the other one called IO-tangle. In fact net-tangles were investigated in Part I while IO-tangles are treated in Part II. Their properties are given within three theorems. After this indices are defined for simple IO-tangles and N-tangles. At the end of the paper a normal form for 2-crossing minimal charts is defined.

Recommendations

• On charts with two crossings. I: There exist no NS-tangles in a minimal chart
• The structure of a minimal \(n\)-chart with two crossings. I: Complementary domains of \({\Gamma}_1 \cup {\Gamma}_{n - 1}\)
• scientific article; zbMATH DE number 5230433
• There exists no minimal n-chart of type (2,2,2)
• Properties of minimal charts and their applications. II
• Chart descriptions of regular braided surfaces
• On charts with two crossings II
• scientific article; zbMATH DE number 2195296
• Simplifying branched covering surface-knots by an addition of 1-handles with chart loops
• Properties of minimal charts and their applications. III

Cites work

• Any chart with at most one crossing is a ribbon chart
• scientific article; zbMATH DE number 510386 (Why is no real title available?)
• scientific article; zbMATH DE number 1113397 (Why is no real title available?)
• scientific article; zbMATH DE number 1774899 (Why is no real title available?)
• scientific article; zbMATH DE number 5211089 (Why is no real title available?)
• Minimal charts
• On charts with two crossings II
• On charts with two crossings. I: There exist no NS-tangles in a minimal chart
• On surface braids of index four with at most two crossings
• SURFACES IN R⁴ OF BRAID INDEX THREE ARE RIBBON
• The closure of a surface braid represented by a 4-chart with at most one crossing is a ribbon surface
• The structure of a minimal \(n\)-chart with two crossings. I: Complementary domains of \({\Gamma}_1 \cup {\Gamma}_{n - 1}\)

Cited in

(3)

• On charts with two crossings. I: There exist no NS-tangles in a minimal chart
• The structure of a minimal \(n\)-chart with two crossings. I: Complementary domains of \({\Gamma}_1 \cup {\Gamma}_{n - 1}\)
• Distinguishing surface-links described by 4-charts with two crossings and eight black vertices

This page was built for publication: The structure of a minimal \(n\)-chart with two crossings. II. Neighbourhoods of \(\Gamma _1\cup \Gamma _{n-1}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317528)