T. Nagase

activity

20192025

collaborators

Showing math.GTShow all

7 papers · 1 filter

math.GT2025

The linear minimal 4-chart with three crossings

Teruo Nagase, Akiko Shima

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…

math.GT2024

Properties of minimal charts and their applications X: charts of type $(5, 2)$

Teruo Nagase, Akiko Shima

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…

math.GT2024

Properties of minimal charts and their applications XI: no minimal charts with exactly seven white vertices

Teruo Nagase, Akiko Shima

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…

math.GT2023

Distinguishing surface-links with 4-charts with 2 crossings and 8 black vertices

Teruo Nagase, Akiko Shima

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…

math.GT2020

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

Teruo Nagase, Akiko Shima

Let $Γ$ be a chart, and we denote by $Γ_{m}$ the union of all the edges of label $m$ . A chart $Γ$ is of type $(2, 3, 2)$ if there exists a label $m$ such that $w (Γ) = 7$ , $w(Γ_m\capΓ_{m+…

math.GT2020

Properties of minimal charts and their applications VI: the graph $Γ_{m + 1}$ in a chart $Γ$ of type $(m; 2, 3, 2)$

Teruo Nagase, Akiko Shima

Let $Γ$ be a chart, and we denote by $Γ_{m}$ the union of all the edges of label $m$ . A chart $Γ$ is of type $(m; 2, 3, 2)$ if $w (Γ) = 7$ , $w (Γ_{m} \cap Γ_{m + 1}) = 2$ , $w (Γ_{m + 1} \cap Γ_{m + 2}) = 3$ …

The linear minimal 4-chart with three crossings

Properties of minimal charts and their applications X: charts of type (5,2)

Properties of minimal charts and their applications XI: no minimal charts with exactly seven white vertices

Distinguishing surface-links with 4-charts with 2 crossings and 8 black vertices

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

Properties of minimal charts and their applications VI: the graph Γm+1​ in a chart Γ of type (m;2,3,2)

Properties of minimal charts and their applications X: charts of type $(5, 2)$

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

Properties of minimal charts and their applications VI: the graph $Γ_{m + 1}$ in a chart $Γ$ of type $(m; 2, 3, 2)$