scientific article; zbMATH DE number 3938045

From MaRDI portal
Publication:3709484





The author gives an effective geometric algorithm to construct a Seifert surface S of minimal genus for an arbitrary oriented arborescent link L in \(S^ 3\). The surface S constructed is decomposable in the sense of the author's paper [J. Differ. Geom. 18, 445-503 (1983; Zbl 0533.57013)]; thus S is a leaf of a 2-dimensional foliation on \(S^ 3\) which allows to apply \textit{W. P. Thurston} [Mem. Am. Math. Soc. 339, 99-130 (1986; see review 57006 below)] and to conclude that S is a surface of minimal genus for L. It is pointed out in the introduction to the paper that with practice the methods of this paper allow one to compute the genera of almost any reasonable knot. Besides the introduction, the paper includes 7 sections and 2 appendices. In {\S} 1 the concepts of arborescent link and decomposable surface are reminded. In {\S} 2 it is shown that any oriented arborescent link L can be represented by a special tree which gives rise to a Seifert surface for L, a candidate surface. {\S} 3 presents an analysis of pretzel links of type \((n_ 1,...,n_ k)\) where \(n_ 1,...,n_ k\) have the same parity. Excepting 4 easy cases the obvious orientable spanning surface (which is a candidate surface) turns out to be decomposable and hence of minimal genus. The argument involves a beautiful geometric calculus of surfaces with boundary in \(S^ 3\) which enables one to decompose surfaces. In {\S} 4 an effective procedure is given to decide whether or not a given candidate surface has the minimal genus. Unfortunately, some arborescent links do not possess minimal genus candidate surfaces. This phenomenon is analyzed on the local level in {\S} 5 where in particular the genus of the Kinoshita-Terasaka knot \(KT_{rn}\) is computed to be r. In {\S}{\S} 6-7 the case of general arborescent links is treated. The appendices are intended to teach the reader to decompose surfaces in \(S^ 3\). For the entire collection see [Zbl 1415.57001].




Cited in
(34)








This page was built for publication:

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