arXiv Analytics

Sign in

arXiv:2003.12188 [math.GT]AbstractReferencesReviewsResources

Properties of minimal charts and their applications VII: charts of type $(m;2,3,2)$

Teruo Nagase, Akiko Shima

Published 2020-03-27Version 1

Let $\Gamma$ be a chart, and we denote by $\Gamma_m$ the union of all the edges of label $m$. A chart $\Gamma$ is of type $(2,3,2)$ if there exists a label $m$ such that $w(\Gamma)=7$, $w(\Gamma_m\cap\Gamma_{m+1})=2$, $w(\Gamma_{m+1}\cap\Gamma_{m+2})=3$, and $w(\Gamma_{m+2}\cap\Gamma_{m+3})=2$ where $w(G)$ is the number of white vertices in $G$. In this paper, we prove that there is no minimal chart of type $(2,3,2)$.

Comments: 37 pages, 26 figures
Categories: math.GT
Subjects: 57Q45, 57Q35
Related articles: Most relevant | Search more
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:1603.04639 [math.GT] (Published 2016-03-15)
Properties of minimal charts and their applications IV: Loops
arXiv:1902.00007 [math.GT] (Published 2019-01-31)
Properties of minimal charts and their applications V: charts of type $(3,2,2)$