The structure of a minimal n-chart with two crossings I: Complementary domains of 1n-1

Abstract

This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label m of a chart we denote by m the union of all the edges of label m and their vertices. For a minimal chart with exactly two crossings, we can show that the two crossings are contained in αβ for some labels α<β. In this paper, we study the structure of a disk D not containing any crossing but satisfying ∂ D⊂α+1 β-1.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…