Kirby diagrams and 5-colored graphs representing compact 4-manifolds

It is well-known that in dimension 4 any framed link (L, c) uniquely represents the PL 4-manifold M4(L,c)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^4(L,c)$$\end{document} obtained from D4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {D}}^4$$\end{document} by adding 2-handles along (L, c). Moreover, if trivial dotted components are also allowed (i.e. in case of a Kirby diagram(L(∗),d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(L^{(*)},d)$$\end{document}), the associated PL 4-manifold M4(L(∗),d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^4(L^{(*)},d)$$\end{document} is obtained from D4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathbb {D}}^4$$\end{document} 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 M4(L(∗),d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^4(L^{(*)},d)$$\end{document}, directly “drawn over” a planar diagram of (L(∗),d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(L^{(*)},d)$$\end{document}, or equivalently how to algorithmically obtain a triangulation of M4(L(∗),d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^4(L^{(*)},d)$$\end{document}. 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 M4(L(∗),d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$M^4(L^{(*)},d)$$\end{document} are obtained, in terms of the combinatorial properties of the Kirby diagram.


Introduction
Among combinatorial tools representing PL manifolds, framed links (and/or Kirby diagrams) turn out to be a very synthetic one, both in the 3-dimensional setting and in the 4-dimensional one, while edgecolored graphs have the advantage to represent all compact PL manifolds and to allow the definition and computation of interesting PL invariants in arbitrary dimension (such as the regular genus, which extends the Heegard genus, and the gem-complexity, similar to Matveev's complexity of a 3-manifold).
Previous works exist establishing a connection between the two theories, both in the 3-dimensional and 4-dimensional setting ( [26], [5], [7]): they make use of the so called edge-colored graphs with boundary, which are dual to colored triangulations of PL manifolds with non-empty boundary, and fail to be regular.More recently, a unifying method has been introduced and studied, so to represent by means of regular colored graphs all compact PL manifolds, via the notion of singular manifold associated to a PL manifold with non-empty boundary.
In this paper we describe how to obtain algorithmically a regular 5-colored graph representing M 4 (L, c) (resp.representing M 4 (L (m) , d)) directly "drawn over" a planar diagram of (L, c) (resp. of (L (m) , d)): see Procedure B and Theorem 7 in Section 3 (see Procedure C and Theorem 12 in Section 5).Hence, the algorithms allow to construct explicitly triangulations of the compact 4-manifolds associated to framed links and Kirby diagrams1 .
As a consequence, the procedures yield upper bounds for both the invariants regular genus and gem-complexity of the represented 4-manifolds.
As regards framed links, the upper bounds -which significantly improve the ones obtained in [5] -are summarized in the following statement where m α denotes the number of α-colored regions in a chess-board coloration of L, by colors α and β say, with the convention that the infinite region is α-colored; furthermore, if w i and c i denote respectively the writhe and the framing of the i-th component of L, (for each i ∈ {1, . . ., l}, l being the number of components of L), we set: Theorem 1 Let (L, c) be a framed link with l components and s crossings.Then, the following estimation of the regular genus of M 4 (L, c) holds: Moreover, if L is not the trivial knot, then the gem-complexity of M 4 (L, c) satisfies the following inequality: As regards Kirby diagrams (L (m) , d), the estimation for the gem-complexity involves the quantity ti , defined exactly as in the case of framed links, but only for the framed components, while the estimation for the regular genus involves a quantity depending on the construction (i.e. the quantity u appearing in Theorem 12), which can be increased by the number of undercrossings of the framed components.Moreover, the process is applied in order to obtain a pair of 5-colored graphs representing an exotic pair of compact PL 4-manifolds (i.e. a pair of 4-manifolds which are TOP-homeomorphic but not PL-homeomorphic), thus opening the search for possibile graph-defined PL invariants distinguishing them (Example 4 in Section 3, with related Figures 8 and 9).Note that, although for better understanding the procedure regarding framed links is presented in a separate section of the paper, it is nothing but a particular case of the one regarding Kirby diagrams with m ≥ 1 dotted components.Hence, if we denote by (L ( * ) , d) an arbitrary Kirby diagram (possibly without dotted components), we can concisely state that the paper shows how to obtain a 5-colored graph representing the compact 4-manifold M 4 (L ( * ) , d), directly "drawn over" the Kirby diagram (L ( * ) , d).
Finally, we point out that, if the associated 3-manifold is the 3-sphere, then the obtained 5colored graph actually represents the closed 4-manifold M 4 (L ( * ) , d), too.Hence, the procedure yields triangulations for any closed (simply-connected) PL 4-manifold admitting handle decompositions without 3-handles.
In the general case of Kirby diagrams representing a closed 4-manifold M 4 (L ( * ) , d) (i.e., according to [29], in case of Heegaard diagrams for closed 4-manifolds), we hope soon to be able to extend the above procedure, in order to construct algorithmically -at least in a wide set of situations, when the boundary 3-manifold may be combinatorially recognized as # r (S 1 × S2 ) (with r ≥ 1) -a 5-colored graph representing M 4 (L ( * ) , d).

Colored graphs representing PL manifolds
In this section we will briefly recall some basic notions about the representation of compact PL manifolds by regular colored graphs (crystallization theory).For more details we refer to the survey papers [19] and [12].
From now on, unless otherwise stated, all spaces and maps will be considered in the PL category, and all manifolds will be assumed to be connected and orientable 3 .
Crystallization theory was first developed for closed manifolds; the extension to the case of nonempty boundary, that is more recent, is performed by making use of the wider class of singular manifolds.
Definition 1 A singular (PL) n-manifold is a closed connected n-dimensional polyhedron admitting a simplicial triangulation where the links of vertices are closed connected (n − 1)-manifolds, while the links of all h-simplices of the triangulation with h > 0 are (PL) (n − h − 1)-spheres.Vertices whose links are not PL (n − 1)-spheres are called singular.
Remark 1 If N is a singular n-manifold, then a compact n-manifold Ň is easily obtained by deleting small open neighbourhoods of its singular vertices.Obviously N = Ň iff N is a closed manifold, otherwise Ň has non-empty boundary (without spherical components).Conversely, given a compact n-manifold M , a singular n-manifold M can be constructed by capping off each component of ∂M by a cone over it.
Note that, by restricting ourselves to the class of compact n-manifolds with no spherical boundary components, the above correspondence is bijective and so singular n-manifolds and compact n-manifolds of this class can be associated to each other in a well-defined way.
For this reason, throughout the present work, we will make a further restriction considering only compact manifolds without spherical boundary components.Obviously, in this wider context, closed n-manifolds are characterized by M = M .
In the following, for sake of concision, when the coloration is clearly understood, we will drop it in the notation for a colored graph.As usual, we will call order of a colored graph the number of its vertices.
For any (n+1)-colored graph Γ, an n-dimensional simplicial cell-complex K(Γ) can be constructed in the following way: • the n-simplexes of K(Γ) are in bijective correspondence with the vertices of Γ and each n-simplex has its vertices injectively labeled by the elements of ∆ n ; • if two vertices of Γ are c-adjacent (c ∈ ∆ n ), the (n − 1)-dimensional faces of their corresponding n-simplices that are opposite to the c-labeled vertices are identified, so that equally labeled vertices coincide.

|K(Γ)
| turns out to be an n-pseudomanifold and Γ is said to represent it.Note that, by construction, Γ can be seen as the 1-skeleton of the dual complex of K(Γ).As a consequence there is a bijection between the {c 1 , . . ., c h }-residues of Γ and the (n − h)-simplices of K(Γ) whose vertices are labeled by ĉ1 • • • ĉh .In particular, given an (n + 1)-colored graph Γ, each connected component of Γ ĉ (c ∈ ∆ n ) is an n-colored graph representing the disjoint link4 of a c-labeled vertex of K(Γ), that is also (PL) homeomorphic to the link of this vertex in the first barycentric subdivision of K.
Furthermore, in virtue of the bijection described in Remark 1, an (n + 1)-colored graph Γ is said to represent a compact n-manifold M with no spherical boundary components (or, equivalently, to be a gem of M , where gem means Graph Encoding Manifold) if Γ represents its associated singular manifold, i.e. if |K(Γ)| = M .Actually, if ∂M = ∅, K(Γ) naturally gives rise to a "triangulation" of M consisting of partially truncated n-simplexes obtained by removing small open neighbourhoods of the singular vertices of M .Therefore, in the present paper, by a little abuse of notation, we will call K(Γ) a triangulation of M also in the case of a compact manifold with non-empty boundary.
The following theorem extends to the boundary case a well-known result -originally stated in [31] -founding the combinatorial representation theory for closed manifolds of arbitrary dimension via regular colored graphs.
If Γ is a gem of a compact n-manifold, an n-residue of Γ will be called singular if it does not represent S n−1 .Similarly, a color c will be called singular if at least one of the ĉ-residues of Γ is singular.
An advantage of colored graphs as representing tools for compact n-manifolds is the possibility of combinatorially defining PL invariants.
One of the most important and studied among them is the (generalized) regular genus extending to higher dimension the classical genus of a surface and the Heegaard genus of a 3-manifold.Spheres are characterized by having null regular genus ( [16]), while classification results according to regular genus and concerning 4-and 5-manifolds can be found in [14], [6], [12], [8] both for the closed and for the non-empty boundary case.
The definition of the invariant relies on the following result about the existence of a particular type of embedding of colored graphs into closed surfaces.Proposition 4 ( [20]) Let Γ be a bipartite 6 (n + 1)-colored graph of order 2p.Then for each cyclic permutation ε = (ε 0 , . . ., ε n ) of ∆ n , up to inverse, there exists a cellular embedding, called regular, of Γ into an orientable closed surface F ε (Γ) whose regions are bounded by the images of the {ε j , ε j+1 }colored cycles, for each j ∈ Z n+1 .Moreover, the genus (1)

Definition 3
The regular genus of an (n + 1)-colored graph Γ is defined as the (generalized) regular genus of a compact n-manifold M is defined as Within crystallization theory a notion of "complexity" of a compact n-manifold arises naturally and, similarly to other concepts of complexity (for example Matveev's complexity for 3-manifolds) is related to the minimum number of n-simplexes in a colored triangulation of the associated singular manifold: Definition 4 The (generalized) gem-complexity of a compact n-manifold M is defined as Important tools in crystallization theory are combinatorial moves transforming colored graphs without affecting the represented manifolds (see for example [19], [18], [3], [26], [27]); we will recall here only the most important ones, while other moves will be introduced in the following sections.
Definition 5 An r-dipole (1 ≤ r ≤ n) of colors c 1 , . . ., c r in an (n + 1)-colored graph Γ is a subgraph of Γ consisting in two vertices joined by r edges, colored by c 1 , . . ., c r , such that the vertices belong to different ĉ1 . . .ĉr -residues of Γ.An r-dipole can be eliminated from Γ by deleting the subgraph and welding the remaining hanging edges according to their colors; in this way another (n + 1)-colored graph Γ is obtained.The addition of the dipole to Γ is the inverse operation.Without going into details, we point out that -as proved in the quoted paper -the elimination (or the addition) of a proper dipole corresponds to a re-triangulation of a suitable ball embedded in the cell-complex associated to the colored graph.
Remark 2 Note that, if Γ represents a compact n-manifold M , then all r-dipoles with 1 < r ≤ n are proper; further, if M has either empty or connected boundary, then 1-dipoles are proper, too.
Given an arbitrary (n + 1)-colored graph representing a compact n-manifold M with empty or connected boundary, then by eliminating all possible (proper) 1-dipoles, we can always obtain an (n + 1)-colored graph Γ still representing M and such that for each color c ∈ ∆ n , Γ ĉ is connected.Such a colored graph is called a crystallization of M.Moreover, it is always possible to assume -up to permutation of the color set -that any gem (and, in particular, any crystallization) of such a manifold, has color n as its (unique) possible singular color.
Finally, as already hinted to in the Introduction, we recall that a graph-based representation for compact PL manifolds with non-empty boundary -different from the one considered in this section -was already introduced by Gagliardi in the eighties (see [19]) by means of colored graphs failing to be regular.
More precisely, any compact n-manifold can be represented by a pair (Λ, λ), where λ is still an edge-coloration on E(Λ) by means of ∆ n , but Λ may miss some (or even all) n-colored edges: such a (Λ, λ) is said to be an (n + 1)-colored graph with boundary, regular with respect to color n, and vertices missing the n-colored edge are called boundary vertices.
However, a connection between these different kinds of representation can be established through an easy combinatorial procedure, called capping-off.Proposition 6 ( [17]) Let (Λ, λ) be an (n + 1)-colored graph with boundary, regular with respect to color n, representing the compact n-manifold M .Chosen a color c ∈ ∆ n−1 , let (Γ, γ) be the regular (n + 1)-colored graph obtained from Λ by capping-off with respect to color c, i.e. by joining two boundary vertices by an n-colored edge, whenever they belong to the same {c, n}-colored path in Λ.Then, (Γ, γ) represents the singular n-manifold M , and hence M , too.
3 From framed links to 5-colored graphs In this section we will present a construction that enables to obtain 5-colored graphs representing all compact (simply-connected) 4-manifolds associated to framed links, i.e.Kirby diagrams without dotted components.Note that such a class of compact 4-manifolds contains also each closed (simplyconnected) 4-manifold admitting a special handle decomposition ([28, Section 3.3]), i.e. a handle decomposition containing no 1-and 3-handles.
As already recalled in the Introduction, for each framed link (L, c) (c = (c 1 , . . ., c l ), with c i ∈ Z ∀i ∈ {1, . . ., l}, l being the number of components of L), we denote by M 4 (L, c) the 4-manifold with boundary obtained from D 4 by adding l 2-handles according to the framed link (L, c).The boundary of M 4 (L, c) is the closed orientable 3-manifold M 3 (L, c) obtained from S 3 by Dehn surgery along (L, c).In case M 3 (L, c) ∼ = S 3 , we will consider, and still denote by M 4 (L, c), the closed 4-manifold obtained by adding a further 4-handle.Now, let us suppose that the link L is embedded in S 3 = R 3 ∪ {∞} so that it admits a regular projection π : S 3 → R 2 × {0}; in the following we will identify L with its planar diagram π(L), thus referring to arcs, crossings and regions of L instead of π(L).
Similarly, by the writhe of a component L i of L (denoted by w(L i )) we mean the writhe of the corresponding component of π(L).For each i ∈ {1, . . ., l}, we say that L i needs |c i −w(L i )| "additional curls", which are positive or negative according to whether c i is greater or less than w(L i ) (see Figure 1).
In [5] a construction is described, yielding a 4-colored graph representing the 3-manifold associated to a given framed link .The procedure consists of the following steps.
1.Each crossing of L gives rise to the order eight graph in Figure 2, while each possible (whether already in L or additional) curl gives rise to one of the order four graphs of Figure 3-left or Figure 3-right according to the curl being positive or negative.2. The hanging 0-and 1-colored edges of the above graphs should be "pasted" together so that every region of L, having r crossings on its boundary, gives rise to a {1, 2}-colored cycle of length 2r (with each 1-colored edge corresponding to a part of the boundary between two crossings) while each component L i (i ∈ {1, . . ., l}), having s i crossings and t i additional curls, gives rise to two {0, 3}-colored cycles of length 2(s i + t i ).Remark 3 As pointed out in [5], Λ(L, c) can be directly "drawn over" L (see for example Figure 4, obtained by applying Procedure A to the trefoil knot, with framing c = +1).In particular, if a is the part of an arc of L lying between two adjacent crossings, there are exactly two 1-colored edges of Λ(L, c) that are "parallel" to a, one for each region of L having a on its boundary.Moreover, note that -by possibly adding to L a trivial pair of opposite additional curls -a particular subgraph Q i , called quadricolor, can be selected in Λ(L, c) for each component

l}).
A quadricolor consists of four vertices {P 0 , P 1 , P 2 , P 3 } such that P s , P s+1 are connected by an scolored edge (for each s ∈ Z 4 ) and P s does not belong to the {s + 1, s + 2}-colored cycle shared by the other three vertices.It is not difficult to see that -in virtue of the above described procedure Asuch a situation arises with {P 0 , P 2 , P 3 } belonging to the subgraph corresponding to a curl and P 1 to an adjacent undercrossing or curl of the same sign (see again Figure 4, where the vertices of the quadricolor are highlighted).Let us now describe how to construct, starting from a given framed link, a 5-colored graph which will be proved to represent the 4-manifold associated to the framed link itself.
1. Let Λ(L, c) be the 4-colored graph constructed from (L, c) according to Procedure A.

2.
For each component L i of L (i ∈ {1, . . ., l}), choose a quadricolor Q i , according to Remark 3.For each i ∈ {1, . . ., l}, add a triad of 4-colored edges between the vertices P 2r and P 2r+1 , ∀r ∈ {0, 1, 2}, involved in the quadricolor Q i (as shown in Figure 5).The following theorem states that -as already disclosed -the 5-colored graph Γ(L, c) represents M 4 (L, c).Moreover, the theorem also states the existence of a further 5-colored graph representing M 4 (L, c), with reduced regular genus, whose estimation involves the number m α of α-colored regions in a chess-board coloration of L, by colors α and β say, with the convention that the infinite region is α-colored.
With this aim, if (L, c) is a framed link with l components and s crossings, let us recall that, where w i denotes the writhe of the i-th component of L.
Theorem 7 (i) For each framed link (L, c), the 5-colored graph Γ(L, c) obtained via Procedure B represents the compact 4-manifold M 4 (L, c); it has regular genus less or equal to s + l + 1 and, if L is different from the trivial knot,7 its order is 8s + 4 l i=1 ti ; (ii) via a standard sequence of graph moves, a 5-colored graph, still representing M 4 (L, c), can be obtained, whose regular genus is less or equal to m α + l, while the regular genus of its 4-residue, representing ∂M 4 (L, c) = M 3 (L, c), is less or equal to m α .
Theorem 7 will be proved in Section 4.
As a direct consequence of Theorem 7, upper bounds can be established for both the invariants regular genus and gem-complexity of a compact 4-manifold represented by a framed link (L, c), in terms of the combinatorial properties of the link itself, as already stated in Theorem 1 in the Introduction.
Proof of Theorem 1 The upper bound for the regular genus of M 4 (L, c) trivially follows from Theorem 7 (ii).
As regards the upper bound for the gem-complexity of M 4 (L, c), we have to make use of the computation of the order of Γ(L, c) obtained in Theorem 7 (i), but also to note that -as already pointed out in [5] -the 4-colored graph Λ(L, c) has exactly l 2-residues, and that the same happens for Γ(L, c); hence, by deleting l − 1 (proper) 1-dipoles, a new 5-colored graph Γ (L, c) representing M 4 (L, c) may be obtained, with The case of the trivial knot is discussed in the following example.
Example 1 Let (K 0 , c) be the trivial knot with framing c ∈ N ∪ {0}; if c ≥ 2, then K 0 requires c additional positive curls and the 5-colored graph Γ(K 0 , c), with 4c vertices, which is obtained by applying Procedure B, turns out to coincide with the one that in [8] is proved to represent exactly ξ c , the D 2 -bundle over S 2 with Euler number c, as expected from Theorem 7. Furthermore, if c is even, it is known that k(L(c, 1)) = 2c − 1 (see [9,Remark 4.5]); hence Γ(K 0 , c) realizes the gem-complexity of ξ c , and therefore the second bound of Theorem 7 is sharp.
If c = 0 (resp.c = 1), then K 0 requires two positive and two negative (resp.two positive and one negative) additional curls in order to get a quadricolor; however in this case the resulting graph Γ(K 0 , c) admits a sequence of dipole moves consisting in three 3-dipoles and one 2-dipole (resp.consisting in two 3-dipoles) cancellations yielding a minimal order eight crystallization of S 2 × D 2 (resp.the minimal order eight crystallization of CP 2 ) obtained in [8] (resp. in [22]).
Note that for each c ∈ N ∪ {0}, Γ(K 0 , c) realizes the regular genus of the represented 4-manifold, which is equal to 2 (= m α + l), as proved in [8].Hence, for this infinite family of compact 4-manifolds, the first upper bound of Theorem 1 turns out to be sharp.
We will end this section with further examples of the described construction.
Example 2 Let (L H , c) be the Hopf link and c = (c, 0) with c even (resp.odd); then Procedure B yields a 5-colored graph that, by Theorem 7, represents S 2 × S 2 (resp.CP 2 #(−CP 2 )) and realizes its regular genus (which is known to be equal to 4: see [12] and references therein).In particular, if c = 0, a sequence of dipole cancellations and a ρ-pair switching (see Definition 6 in Section 5), applied to Γ(L H , (0, 0)), yield a 5-colored graph which belongs to the existing catalogue8 of crystallizations of 4-manifolds up to gem-complexity 8 (see [10]).
Example 3 Let M 4 (L, c) be a linear plumbing of spheres, whose boundary is therefore the lens space L(p, q) such that (c 1 , . . ., c l ) is a continued fraction expansion of − p q ([23]); then, by Theorem 1, the regular genus of M 4 (L, c) is less or equal to 2l.
Example 4 Procedure B, applied to the framed links description given in [30] of an exotic pair (see Figure 7), allows to obtain two regular 5-colored graphs representing two compact simply-connected PL 4-manifolds W 1 and W 2 with the same topological structure that are not PL-homeomorphic: see Figures 8 and 9, which obviously encode two triangulations of W 1 and W 2 respectively.
Other applications of the procedures obtained in the present paper, in order to get triangulations of exotic 4-manifolds, will appear in R.A. Burke, Triangulating Exotic 4-Manifolds (in preparation).Let us now go into details.Given a framed link (L, c), we can always assume that, for each component L i (i ∈ {1, . . ., l}), an additional curl is placed near an undercrossing; as observed in Section 3 such a configuration gives rise, in the 4-colored graph Λ(L, c), to a quadricolor that we denote by Q i .By cancelling the quadricolor Q i and pasting the resulting hanging edges of the same color, we obtain a new 4-colored graph Λ (î) (L, c); we call this operation the smoothing of the quadricolor Q i .
The following proposition shows that the smoothing of a quadricolor in a 4-colored graph obtained from a framed link via Procedure B (see Section 3) turns out to be equivalent to the Dehn surgery on the complementary knot of the involved link component.More precisely, with the above notations, the result can be stated as follows: ) is the 4-colored graph obtained from Λ(L, c) by smoothing the quadricolor of the i-th framed component, then K(Λ (î) (L, c)) is obtained from K(Λ(L, c)) by Dehn surgery on the complementary knot of L i .
Proof.Let (L (ĩ) , c (ĩ) ) denote the l + 1 components link obtained from L by adding the complementary knot of L i , i.e. a framed 0 trivial knot linking the component L i geometrically once; moreover, let us suppose that the added trivial component is inserted between the curl and the crossing corresponding to the quadricolor Q i .Then, let us consider the 4-colored graph Λ(L (ĩ) , c (ĩ) ) obtained by applying Procedure B of Section 3 to the framed link (L (ĩ) , c (ĩ) ).
Λ(L (ĩ) , c (ĩ) ) is everywhere like Λ(L, c) except "near" the quadricolor Q i , where it contains the subgraph in Figure 10 (we denote by P j , j ∈ {0, 1, 2, 3} the vertices of Q i , even if they are no longer a quadricolor in Λ(L (ĩ) , c (ĩ) )).In the proof of Lemma 4 of [5] it is shown that the above subgraph yields, through a sequence of eliminations of dipoles, the subgraph in Figure 11.
Since the addition to (L, c) of the complementary knot of L i corresponds to the Dehn surgery along it, the first part of the statement is proved.Moreover, the last part follows directly by noting that the component L i and its complementary knot constitute a pair of complementary handles, whose cancellation does not affect the represented 3-manifold.smooth (resp.Γ smooth ), obtained from Λ(L, c) by exchanging the triad of 1-colored edges (according to Figure 12) in a quadricolor of the i-th component of (L, c) (resp. in a quadricolor for each framed component of (L, c)), represents the 3-manifold associated to the framed link (L î, c î) obtained from (L, c) by deleting the i-th component (resp.represents S 3 ).
(ii) Let Γsmooth be the 5-colored graph obtained from Γ smooth by "capping off" with respect to color 1.Then, the 5-colored graph Γ(i) , obtained from Γsmooth by exchanging the triad of 1-colored edges (according to Figure 13) in a quadricolor of the i-th component of (L, c), represents the 4-manifold obtained from D 4 by adding a 2-handle according to the i-the component of (L, c)).

Proof.
(i) It is sufficient to make use of the proof of Proposition 8 and to note that Γ (î) smooth is obtained (modulo the name exchange of P j into Pj , for j ∈ {0, 2, 3}) from the subgraph in Figure 11 via cancellation of the two 2-dipoles of vertices { P0 , R 1 }, { P3 , R 3 } in the quadricolor of the i-th framed component, while Γ smooth is obtained by performing the same procedure for each component of (L, c).(ii) It is easy to check that, by a standard sequence of dipole addition, the 4-colored graph Γ smooth may be transformed (modulo the name exchange of P 2 into P2 and P j into Pj , for j ∈ {0, 3}) in the 4-colored graph Λ4 (L, c), already considered both in [5] and in [7]: more precisely, for each component of the link, it is necessary to add the 2-dipoles of vertices { P0 , R 1 } and { P3 , R 3 } shown in Figure 11, and then to add a 2-dipole of vertices {R 2 , R 3 } within the 1-colored edge with endpoints {R 1 , R 3 } and the 3-colored edge with endpoints { P0 , R 1 }.The 4-colored graph Λ4 (L, c) is deducible from Figure 14, that illustrates the main step to obtain the 5-colored graph with boundary Λ(L, c), representing M 4 (L, c), from the 4-colored graph Λ(L, c).
Moreover, as explained in [7, pp.442-443], the 1-skeleton of the associated colored triangulation with linking number c i between L i and L i , for each i ∈ {1, . . ., l}, and the addition of the triad of 4-colored edges with endpoints {R 1 , R 1 }, {R 2 , R 2 }, {R 3 , R 3 } corresponds -as proved in [5, Theorem 3] -to the attachment on the boundary of D 4 (i.e. the cone over K(L, c)) of a 2-handle whose attaching map sends L i into L i (see Figure 14-right, and Figure 15 for an example of the 5-colored graph with boundary9 Λ(L, c), where (L, c) is the trefoil knot with framing +1).Now, if the "capping off" procedure described in Proposition 6 is applied with respect to color 1, the obtained regular 5-colored graph (which represents the compact 4-manifold obtained from D 4 by adding a 2-handle along the i-th component of (L, c)) turns out to admit a sequence of three 2-dipoles involving only vertices of the quadricolor and never involving color 4: in fact, they consist of the pairs of vertices {P 3 , R 3 }, {R 3 , R 2 }, {P 0 , R 1 } in Figure 14 (right).It is not difficult to see that, after these cancellations, we obtain exactly the (regular) 5-colored graph Γ(i) , obtained from Γsmooth (which obviously represents D 4 ) by cyclically exchanging the triad of 1-colored edges (according to Figure 13) in the quadricolor Q i of the i-th component of (L, c). 2 Remark 5 Note that a standard sequence of dipole moves exists, transforming Γ (î) smooth into Λ(L î, c î): it follows L i starting from the quadricolor Q i , where the triad of 1-colored edges have been cyclically exchanged as in Figure 12 (right), by deleting first the 2-dipoles {P 2 , P 3 } and {P 4 , P 5 }, and then all subsequently generated 2-dipoles, among pairs of vertices, belonging to different bipartition classes, which are either endpoints of 1-colored edges "parallel" to adjacent segments of L i , or 0-adjacent vertices of the subgraph associated to an undercrossing of L i , till to obtain an order two component of the 4-colored graph consisting only of the vertex P 0 and its 2-adjacent vertex.Obviously, if the procedure is applied for each i ∈ {1, . . ., l}, a standard sequence of dipole eliminations is obtained, transforming the 4-colored graphs Γ smooth into the order two 4-colored graph representing S 3 .Proof of Theorem 7 (i) In order to prove that Γ(L, c) represents M 4 (L, c), it is sufficient to note that the main step yielding Γ(L, c), depicted in Figure 5, exactly coincides with the transformation from the 4-colored graph of Figure 12-left (representing M 3 (L, c)) to the 5-colored graph of Figure 13-right (representing M 4 (L, c), if the procedure is applied to a quadricolor for each component of (L, c)).Hence, Proposition 9 (i) and (ii) ensure Γ(L, c) actually to represent the compact 4-manifold obtained from D 4 by adding l 2-handles according to the l components of (L, c).Now note that, by construction, the 4-colored graph Λ(L, c) has 8s + 4 l i=1 |w i − c i | vertices.As already observed, the presence of a curl near an undercrossing in a component of L yields a quadricolor Q i .Therefore, for each i ∈ {1, . . ., l}, if |w i − c i | = 0, then the required addition of curls ensures the existence of a quadricolor relative to L i , while if |w i − c i | = 0 a pair of opposite curls has to be added in order to produce one (except in the case of the trivial knot which is discussed in Example 1).Since each curl contributes with 4 vertices to the final 5-colored graph, the statement concerning the order of Γ(L, c) is easily proved.
As already pointed out in [5], the construction of Λ(L, c) directly yields ρ ε(Λ(L, c)) = s + 1.On the other hand, it is easy to check -via formula (1) -that where 2p is the order of Γ(L, c) (as well as of Λ(L, c)).
(ii) As proved in [5, Theorem 1], the 4-colored graph Λ(L, c) admits a finite sequence of moves, called generalized dipole eliminations 10 , which preserve the represented manifold and do not affect the quadricolor structures, but reduce the regular genus.Hence, a new 4-colored graph Ω(L, c) representing M 3 (L, c) is obtained, having regular genus m α with respect to the cyclic permutation ε = (1, 0, 2, 3) of ∆ 3 (see [5] for details).Ω(L, c) contains a quadricolor for each component of L, too, and the results of Proposition 9 (i) and (ii) may be applied, exactly as previously done for Λ(L, c), so to obtain -via the move depicted in Figure 5 performed on a quadricolor for each component of La new 5-colored graph Γ(L, c) representing M 4 (L, c). 11Now, it is not difficult to check that -in full analogy to equation (2) -the following relation holds between the regular genera of Γ(L, c) and Ω(L, c), with respect to ε and ε respectively: Then, both statements of Theorem 7(ii) directly follow from See Figures 16 and 17 for examples of graphs Ω(L, c) and Γ(L, c) respectively, where (L, c) is the trefoil knot with framing +1. 10 A generalized dipole in a 4-colored graph representing a closed 3-manifold is a particular subgraph, whose cancellation factorizes into a sequence of proper dipole moves; from the topological point of view, this move corresponds to a Singer move of type III' involving a pair of curves in a suitable Heegaard diagram which can be associated to the 4-colored graph (see [18] for details).
11 It is not difficult to check that Γ(L, c) could also be obtained through the 5-colored graph with boundary Ω(L, c), constructed in [5] by applying the move depicted in Figure 14 for each component of the link: in fact, Ω(L, c) represents M 4 (L, c), too, and in order to obtain Γ(L, c) it is sufficient to make the capping off with respect to color 1 and to delete three 2-dipoles for each quadricolor, exactly as done in the proof of Proposition 9 (ii) for Γsmooth .In this section we will take into account the more general case of Kirby diagrams with dotted components, extending the procedure and the results of Section 3. Note that, as a consequence, the class of manifolds involved in the construction includes all closed (simply-connected) 4-manifolds admitting a handle decomposition without 3-handles ( [24,Problem 4.18], which is of particular interest with regard to exotic PL 4-manifolds: see, for example, [1] and [2]).
Let (L (m) , d) be a Kirby diagram, where L is a link with l components, L i with i ∈ {1, . . ., m} (resp. In case M 3 (L, c) ∼ = S 3 , we will consider, and still denote by M 4 (L (m) , d), the closed 4-manifold obtained by adding a further 4-handle.
Before describing the new procedure, the following preliminary notations are needed: -For each i ∈ {1, . . ., m}, let us "mark" two points H i and H i on L i , such that they divide L i into two parts, one containing only overcrossings and the other containing only undercrossings of L. 12-For each j ∈ {m + 1, . . ., l}, let us fix on L j a point X j , between a curl and an undercrossing and let us consider the component L j in the diagram of L as the union of consecutive segments obtained by cutting it not only at undercrossings, but also at overcrossings and at the point X j .
-Then, for each j ∈ {m+1, . . ., l} let us "highlight" on L j -starting from X j and in the direction opposite to the undercrossing -a sequence Y j of consecutive segments, so that, for each i ∈ {1, . . ., m}, H i and H i belong to the boundary of the same region R i of the "diagram" obtained from L by deleting the points X m+1 , . . ., X l and the segments of the sequences Y m+1 , . . ., Y l (with a little abuse of notation we will describe this new diagram as L − ∪ l j=m+1 (X j ∪ Y j )).Note that Y j can be empty, while it never comprehends all segments of L j .

Let us denote by
sequence resulting from juxtaposition of the sequences of highlighted segments.
-Finally, for each i ∈ {1, . . ., m}, let ēi (resp.ē i ) be the 1-colored edge of Λ(L, c) "parallel" to the part of arc of L i containing the point H i (resp.H i ) "on the side" of the regions of L merging into R i (see Remark 3), and let v i (resp.v i ) be its endpoint belonging to the subgraph corresponding to an undercrossing of the dotted component L i .
(a) Let Λ(L, c) be the 4-colored graph constructed from (L, c) according to Procedure A; in Λ(L, c), let us choose a quadricolor Q j for each (undotted) component L j (j ∈ {m + 1, . . ., l}) in the position corresponding to the point X j .
(b) Follow the sequence Y = Y m+1 ∧ • • • ∧ Y l , starting, for each j ∈ {m + 1, . . ., l} with Y j = ∅, from the segment corresponding to the pair of 1-colored edges adjacent to vertices P 4 and P 5 identified by the quadricolor Q j ; at each step of the sequence, if f, f is the pair of 1-colored edges which are "parallel" to the considered highlighted segment, then: if no 4-colored edge has already been added to the endpoints of f and f , join, by 4-colored edges, endpoints of f to endpoints of f belonging to different bipartition classes of Λ(L, c); otherwise connect only the endpoints of f and f having no already incident 4-colored edge.
Moreover, if two consecutive highlighted segments correspond to an undercrossing, whose overcrossing does not correspond to previous segments in Y , add 4-colored edges so to double the pairs of 0-colored edges within the subgraph corresponding to that crossing.
(c) For each i ∈ {1, . . ., m}, add a 4-colored edge, so to connect v i and v i .
(e) Add 4-colored edges between the remaining vertices of Λ(L, c), joining those which belong to the same {1, 4}-residue.

Remark 6
We point out that a quadricolor always arises in a component L j (j ∈ {m + 1, . . ., l}) of Λ(L, c) not only between a curl and an undercrossing but also between two curls with the same sign.Actually in this last case two quadricolors appear, one for each curl, and either of them can be indifferently chosen as Q j ; therefore we put the point X j between the curls and the sequence Y j can start from either "side" of it.Moreover, note that the position of points X j may be suitably chosen, so to minimize the length of the sequence Y , provided that the above conditions for the existence of the quadricolor are satisfied.
Example 5 Figures 18 and 19 show the result of the above construction applied to the depicted Kirby diagrams.In particular, note that step (b) of Procedure C is not required for the graph of Figure 18, since the highlighted sequence of segments is empty; on the contrary, the case of Figure 19 requires to highlight a suitable set of consecutive segments in the Kirby diagram, as depicted in Figure 20.Via Kirby calculus, it is easy to check that the 5-colored graph in Figure 18 represents the 4-sphere, while the 5-colored graph in Figure 19 represents S 2 × D 2 ; both facts can also be proved via suitable sequences of dipole moves.
Example 6 Given a framed link (L (m) , d), the above construction may be implemented in different ways, depending on the choice of the points X i (i = m + 1, . . ., l) on the framed components (step (a) of Procedure C) and on the choice of the sequence 21 and 22 show two possibile ways to perform the above choices on the same Kirby diagram: in Figure 21 (resp.Figure 22) the yellow highlighted segments form the sequence Y 3 , while the green highlighted segments form the sequence Y 4 (resp.while Y 4 = ∅).Note that, in the case of Figure 21, the regions R 1 and R 2 of L − ∪ 4 j=3 (X j ∪ Y j ) coincide: they are obtained by merging the shaded regions, together with the infinite one.On the other hand, in the case of Figure 22, the regions R 1 and R 2 of L − ∪ 4 j=3 (X j ∪ Y j ) are distinct.
The proof that the graph obtained via Procedure C really represents M 4 (L (m) , d) is given in Theorem 12.In order to help the reader, we can anticipate that it will be performed by means of the followings steps: (iii) this 5-colored graph is modified by a sequence of moves not affecting the represented 4-manifold (the so called ρ 2 -pairs switching), so to have on one boundary component of [# m (S 1 × S 2 )] × I a particular structure (called ρ 3 -pair) for each dotted component of (L (m) , d);   In order to go into details, the notion of ρ-pair 13 and some preliminary results are needed.
Definition 6 A ρ h -pair (1 ≤ h ≤ n) of color c ∈ ∆ n in a bipartite (n + 1)-colored graph Γ is a pair of c-colored edges (e, f ) sharing the same {c, i}-colored cycle for each i ∈ {c 1 , . . ., c h } ⊆ ∆ n .Colors c 1 , . . ., c h are said to be involved, while the other n − h colors are said to be not involved in the ρ h -pair.The switching of (e, f ) consists in canceling e and f and establishing new c-colored edges between their endpoints in such a way as to preserve the bipartition.
The topological consequences of the switching of ρ n−1 -and ρ n -pairs have been completely determined in the case of closed n-manifolds: see [3], where it is proved that a ρ n−1 -pair (resp.ρ n -pair) switching does not affect the represented n-manifold (resp.either induce the splitting into two connected summands, or the "loss" of a S 1 ×S n−1 summand in the represented n-manifold).In dimension three the study has been performed also in the case of manifolds with boundary: see [15], where more cases are proved to occur.
As we will see in the proof of the following Proposition 11, we are particularly interested in the effect of switching ρ 2 -and ρ 3 -pairs in 5-colored graphs.A useful result is the following.
Lemma 10 Let (e, f ) be a ρ 2 -pair in a 5-colored graph Γ representing a compact 4-manifold M 4 and let Γ be obtained from Γ by switching the ρ 2 -pair.Then Γ represents M 4 , too.
Moreover, for each cyclic permutation ε of ∆ 4 , where ε k is the color of (e, f ): -if both ε k−1 and ε k+1 are involved, then Proof.In order to prove that Γ represents M 4 , too, it is sufficient to observe that the switching of (e, f ) can be factorized by a sequence of dipole moves as shown in Figure 23, i.e. by the addition of a 2-dipole of the colors not involved in the ρ 2 -pair, followed by the cancellation of a 2-dipole of the colors involved in the ρ 2 -pair.Note that any 2-dipole in a 5-colored graph is proper (see Proposition 5), and hence both moves do not change the represented manifold, since -as already pointed out in Section 2 -they correspond to re-triangulations of balls embedded in the cell-complexes associated to the involved colored graphs.With regard to the regular genus of Γ with respect to ε, note that the switching of (e, f ) increases by one (resp.decreases by one) the number of {ε k , i}-colored cycles of Γ if i is an involved (resp.a not involved) color, while the number of {i, j}-colored cycles with i, j = ε k is not changed.An easy calculation yields the statement. 2 Proposition 11 smooth , obtained from Λ(L, c) by exchanging the triad of 1-colored edges (according to Figure 12) in a quadricolor for each framed component of (L (m) , d), represents # m (S 1 × S 2 ).Proof.Part (i) directly follows from Proposition 9 (i), by noting that, if all framed components of (L (m) , d) are deleted, only the m dotted components remain, and the associated framed link, consisting in m disjoint trivial 0-framed components, actually represents the 3-manifold # m (S 1 × S 2 ).As regards part (ii), it is necessary to note that Γ (m) smooth gives rise, by "capping off" with respect to color 1, to a 5-colored graph representing [# m (S 1 × S 2 )] × I, whose two boundary componentsboth homeomorphic to # m (S 1 × S 2 ) -are represented by the (color-isomorphic) subgraphs Θ and Θ , obtained by deleting the 4−colored and 1−colored edges respectively.This 5-colored graph admits smooth yields Λ( m K 0 , 0), the 4-colored graph associated to the trivial link with m 0-framed components (see Remark 5, applied to all framed components of (L (m) , d)).The switching of these ρ 2 -pairs is equivalent (up to "capping off" with respect to color 1) to the addition of 4-colored edges according to step (b) in Λ(L, c).
More precisely, the pairs of 4-colored edges that have to be switched in the sequence of ρ 2 -pairs are exactly the 4-colored edges adjacent to the pairs of vertices constituting 2-dipoles of the sequence of dipole eliminations (starting, for each j ∈ {m + 1, . . ., l} such that Y j = ∅, with the dipole whose vertices are 2-adjacent to the vertices P 4 and P 5 identified by the quadricolor Q j ) from Γ (m) smooth to Λ( m K 0 , 0); moreover, the colors involved in each ρ 2 -pair are exactly those (never comprehending color 1) of the corresponding 2-dipole.
Hence, the graph Γ(m) smooth , obtained after all ρ 2 -pairs switchings, still represents [# m (S 1 × S 2 )] × I and one of its boundary component is represented by Θ, too, but the other is represented by the 4-colored graph Θ obtained from Θ by switching ρ 2 -pairs induced by the above ones.
We point out that, for each i ∈ {1, . . ., m}, the pair of 4-colored edges having an endpoint in v i and v i respectively, turn out to form a ρ 3 -pair of color 4 in Γ(m) smooth .In fact, they double ēi and/or ē i , or they arise from the possible switching of 4-colored edges doubling ēi and/or ē i by the above sequence of ρ 2 -pairs switchings; as a consequence, they belong both to the same {0, 4}-residue and to the same {3, 4}-residue (since ēi and ē i share both the same {0, 1}-residue and the same {1, 3}residue in Λ(L, c)), and the sequence of ρ 2 -pair switchings makes them to belong also to the same {2, 4}-residue (which corresponds to the boundary of the region R i of L − ∪ l j=m+1 (X j ∪ Y j )).It is known that the switching of a ρ 3 -pair in a 4-colored graph representing a closed 3-manifold has the effect of "subtracting" an S 1 ×S 2 summand (see [3] for details); hence the switching of the above m ρ 3 -pairs transforms Θ into a 4-colored graph representing S 3 , while the 4-residue Θ is unaltered and each ĉ-residue with i ∈ {0, 2, 3} still represents the 3-sphere as in Γ(m) smooth (since a ρ 2 -pair switching has been performed in each affected ĉ-residue, for i ∈ {0, 2, 3}).
Moreover, supposing (e, f ) to be one of the above ρ 3 -pairs in Γ(m) smooth , its switching can be factorized as in Figure 24 by inserting a 1-colored edge and subsequently canceling a 3-dipole.The insertion of the 1-colored edge in the colored triangulation associated to Γ(m) smooth consists in "breaking" a tetrahedral face on the boundary of [# m (S 1 × S 2 )] × I corresponding to the 1-residue Θ , and inserting a new pair of 4-simplices sharing the same 3-dimensional face opposite to the 1-labelled vertex; hence, it may be seen as the attachment of a polyhedron homeomorphic to D 3 × D 1 to the considered boundary, so to transform it into a triangulation of # m−1 (S 1 × S 2 ), without affecting the interior of [# m (S 1 × S 2 )] × I, nor its boundary corresponding to the 4-residue. 14Whenever all m ρ 3 -pairs are switched, the 1-residue of the obtained 5-colored graph comes to represent the 3-sphere, i.e. the represented 4-manifold has a connected boundary, corresponding to the (unaltered) 4-residue Θ = Γ This proves statement (ii), since Γ(m) smooth -which admits 4 as its unique singular color -turns out to represent We are now going to prove that the 5-colored graph Γ(L (m) , d) obtained via Procedure C (i.e. by applying to Λ(L, c) steps (b)-(e)) represents the compact 4-manifold associated to the Kirby diagram; we will also give an estimation of its regular genus and compute its order.With this aim, if (L (m) , d) is a Kirby diagram with l components where the first m > 0 ones are dotted and s crossings, and (L, c) is its associated framed link, let us set, for each i ∈ {m + 1, . . ., l}, where w i denotes the writhe of the i-th (framed) component of L; moreover, let us denote by u the number of undercrossings which are passed when following the sequence Y , with the condition that the associated overcrossing does not correspond to previous segments in the sequence itself.Moreover, it has regular genus less or equal to s + (l − m) + u + 1 and, if L is different from the trivial knot, its order is 8s + 4 l i=m+1 ti .
Proof.In order to prove the first statement, we point out that in the proof of Proposition 11 (ii) we have considered a suitable triangulation of [# m (S 1 × S 2 )] × I, and then we have "closed" one of its boundary components by identifying it with the boundary of the genus m 4-dimensional handlebody (via the addition of 4-colored edges according to steps (b) and (c) of the Procedure C).Hence, the polyhedron represented by Γ(m) smooth may be seen as the union of 0-and 1-handles of M 4 (L (m) , d), plus a "collar" on its boundary .Moreover, the "free" boundary, homeomorphic to # m (S 1 × S 2 ), is represented by the 4-colored graph Θ = ( Γ(m) smooth ) 4 = Γ (m) smooth .Then, in order to obtain a 5-colored graph representing M 4 (L (m) , d), it is sufficient to operate on this "free" boundary, so perform the addition of a 2-handle according to each framed component of (L (m) , d).Now, the proof of Proposition In order to give an estimation of the regular genus of Γ(L (m) , d), we first recall that ρ ε(Λ(L, c)) = s + 1 with ε = (1, 0, 2, 3) (see also the proof of Theorem 7(i)), and hence that s + 1 is also the regular genus, with respect to the permutation ε = (1, 0, 2, 3, 4), of the 5-colored graph obtained by doubling the 1-colored edges of Λ(L, c) by color 4.Then, we have to analyze how the the regular genus is affected by the switchings of ρ 2 -and ρ 3 -pairs and the exchanging of triad of edges in the quadricolors described in the proofs of Proposition 11 and Theorem 7. Now, let us point out that color 1 is never involved in the considered ρ 2 -pairs, while color 3 is involved only in one of the two ρ 2 -pairs corresponding to an undercrossing whose associated overcross-ing does not correspond to previous segments in the sequence Y .Therefore, by Lemma 10, the regular genus with respect to ε increases by u, when performing the sequence of ρ 2 -pairs corresponding to the sequence Y.
With regard to the ρ 3 -pairs, since they do not involve color 1, which is consecutive in ε to color 4, the same argument used in the proof of Lemma 10, shows that the regular genus does not change after their switchings.
Finally, the exchanging of the triad of 4-colored edges in a quadricolor, producing the attaching of a 2-handle, decreases by two the number of {1, 4}-colored cycles, while the numbers of all other bicolored cycles remain unaltered (see Figure 13).Hence, the regular genus increases by one for each quadricolor.Since the quadricolors are l − m, the statement is proved.
The proof of the theorem is completed by noting that Γ(L (m) , d) has exactly the same order as Γ(L, c) (and as Λ(L, c), too).Hence, its calculation directly follows from Theorem 7 (i). 2 We are now able to prove both upper bounds for the invariants of the 4-manifold associated to a Kirby diagram, already stated in Theorem 2 in the Introduction.

Theorem 2
Let (L (m) , d) be a Kirby diagram with s crossings, l components, whose first m ≥ 1 are dotted, and s undercrossings of the framed components; then,G(M 4 (L (m) , d)) ≤ s + s + (l − m) + 1 Moreover, if L is different from the trivial knot, k(M 4 (L (m) , d)) ≤ 2s + 2s + 2m − 1 + 2 l i=m+1 tiVarious examples are presented, including infinite families of framed links where the above upper bound for the regular genus turns out to be sharp (Example 1 and Example 2 in Section 3).

Figure 3 :
Figure 3: 4-colored graphs corresponding to a positive curl (left) and a negative curl (right)

Figure 13 :
Figure 13: Exchanging the triad of 1-colored edges in a quadricolor (II)

Figure 17 :
Figure 17: The 5-colored graph Γ(L, c) representing M 4 (L, c), for c = +1 and L = trefoil i ∈ {m + 1, . . ., l}) being a dotted (resp.framed) component, and d = (d 1 , . . ., d l−m ), where d i ∈ Z ∀i ∈ {1, . . ., l − m} is the framing of the (m + i)-th (framed) component.As already recalled in the Introduction, we denote by M 4 (L (m) , d) the 4-manifold with boundary obtained from D 4 by adding m 1-handles according to the dotted components and l − m 2-handles according to the framed components of (L (m) , d).The boundary of M 4 (L (m) , d) is the closed orientable 3-manifold M 3 (L, c) obtained from S 3 by Dehn surgery along the associated framed link (L, c), obtained by substituting each dotted component by a 0-framed one, i.e. c = (c 1 . . ., c l ), where

Figure 20 :
Figure 20: The Kirby diagram of Fig. 19, with points and highlighted segments, according to Procedure C. The yellow highlighted segments form the sequence Y 2 , while Y 3 = ∅.The shaded regions, together with the infinite one, give rise to the region R 1 of L − ∪ 3 j=2 (X j ∪ Y j ) containing both points H 1 and H 1 .

(
ii) The 5-colored graph Γ(m) smooth , obtained by applying steps (b) and (c) of Procedure C to Γ (m) smooth , and then by "capping off" with respect to color 1, represents the genus m 4-dimensional handlebody Y 4 m .

Figure 23 :
Figure 23: Factorization of a ρ 2 -pair switching into two proper dipoles (not affecting the represented 4-manifold) the other hand, the switching of these ρ 3 -pairs is equivalent (up to "capping off" with respect to color 1) to the addition of 4-colored edges in Λ(L, c) according to step (c); therefore, step (c) of Procedure C can be thought as the identification φ between the boundary of a genus m 4-dimensional handlebody Y 4 m and the boundary component represented by Θ in the triangulation of [# m (S 1 × S 2 )] × I obtained in step (b).

Figure 24 :
Figure 24: Factorization of a ρ 3 -pair switching into two moves, the first (resp.second) one possibly affecting (resp.always not affecting) the represented 4-manifold

Proof of Theorem 2
The upper bound for the regular genus of M 4 (L (m) , d) directly follows from the computation of ρ ε(Γ(L (m) , d)) obtained in Theorem 12, together with the trivial inequality u ≤ s.As regards the upper bound for the gem-complexity, it is sufficient to make use of the computation of the order of Γ(L (m) , d) obtained in Theorem 12, by pointing out that Γ(L (m) , d) contains a pair of 3-dipoles of colors {0, 1, 4} for each pair of adjacent undercrossings of dotted components; hence, a new 5-colored graph Γ (L (m) , d)) representing M 4 (L (m) , d) may be obtained, with#V (Γ (L (m) , d)) = #V (Γ(L (m) , d)) −4[(s − s) − m] = 4s + 4s + 4m + 4 l i=m+1 ti .