arXiv Analytics

Sign in

arXiv:1704.01232 [math.GT]AbstractReferencesReviewsResources

The structure of a minimal $n$-chart with two crossings I: Complementary domains of $Γ_1\cupΓ_{n-1}$

Teruo Nagase, Akiko Shima

Published 2017-04-05Version 1

This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $\Gamma$ we denote by $\Gamma_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $\Gamma$ with exactly two crossings, we can show that the two crossings are contained in $\Gamma_\alpha\cap\Gamma_\beta$ for some labels $\alpha<\beta$. In this paper, we study the structure of a disk $D$ not containing any crossing but satisfying $\Gamma\cap \partial D\subset\Gamma_{\alpha+1}\cup \Gamma_{\beta-1}$.

Comments: 40 pages, 21 figures
Categories: math.GT
Subjects: 57Q45, 57Q35
Related articles: Most relevant | Search more
arXiv:2003.12188 [math.GT] (Published 2020-03-27)
Properties of minimal charts and their applications VII: charts of type $(m;2,3,2)$
arXiv:2003.11909 [math.GT] (Published 2020-03-25)
Properties of minimal charts and their applications VI: the graph $Γ_{m+1}$ in a chart $Γ$ of type $(m;2,3,2)$
arXiv:1902.00007 [math.GT] (Published 2019-01-31)
Properties of minimal charts and their applications V: charts of type $(3,2,2)$