It is well-known that in dimension 4 any framed link uniquely represents the PL 4-manifold obtained from by adding 2-handles along . Moreover, if trivial dotted components are also allowed (i.e. in case of a Kirby diagram ), the associated PL 4-manifold is obtained from by adding 1-handles along the dotted components and 2-handles along the framed components. In this paper we study the relationships between framed links and/or Kirby diagrams and the representation theory of compact PL manifolds by edge-colored graphs: in particular, we describe how to construct algorithmically a (regular) 5-colored graph representing , directly “drawn over” a planar diagram of , or equivalently how to algorithmically obtain a triangulation of . As a consequence, the procedure yields triangulations for any closed (simply-connected) PL 4-manifold admitting handle decompositions without 3-handles. Furthermore, upper bounds for both the invariants gem-complexity and regular genus of are obtained, in terms of the combinatorial properties of the Kirby diagram.

生成讲解博客的中文版本

生成AI智能校验的中文版本