On approximability by embeddings of cycles in the plane. (Q1409758)

A PL-map \(\phi: K \to \mathbb R^2\) of a graph \(K\) is said to be \textit{approximable by embedding} in the plane if, for each \(\epsilon >0\), there is an \(\epsilon\)-close to \(\phi\) map \(f: K \to \mathbb R^2\) without self-intersections. In [Topol. Proc. 22, 305--340 (1997; Zbl 0945.54027)], \textit{P. Minc} proves a criterion for approximability by embedding in case \(K=I,\) by means of the notion of \(i\)-derivative of a simplicial map. The present paper yields a new proof of this criterion and proves the following analogous criterion in case \(K=\mathbb S^1:\) Let \(\phi: \mathbb S^1 \to \mathbb R^2\) be a PL-map, which is simplicial for some triangulation of \(\mathbb S^1\) with \(k\) vertices. The map \(\phi\) is approximable by embeddings if and only if, for each \(i =1, \dots k\), the \(i\)-th derivative \(\phi^{(i)}\) neither contains transversal self-intersections nor is the standard winding of degree \(d\notin\{-1, 0, +1\}\). Moreover, the author deduces from the Minc result the completeness of the \textit{E. R. Van Kampen} obstruction [see Abh. Math. Semin. Hamb. Univ. 9, 72--78, 152--153 (1932; Zbl 0005.02604)] to approximability by embedding of PL-maps \(I \to \mathbb R^2\), and generalizes the above criteria to simplicial maps \(T \to \mathbb S^1 \subset\mathbb R^2\), where \(T\) is a graph without vertices of degree \(>3\).