Newton flows for elliptic functions III & IV

An elliptic Newton flow is a dynamical system that can be interpreted as a continuous version of Newton’s iteration method for finding the zeros of an elliptic function f. Previous work focuses on structurally stable flows (i.e., the phase portraits are topologically invariant under perturbations of the poles and zeros for f), including a classification/representation result for such flows in terms of Newton graphs (i.e., cellularly embedded toroidal graphs fulfilling certain combinatorial properties). The present paper deals with non-structurally stable elliptic Newton flows determined by pseudo Newton graphs (i.e., cellularly embedded toroidal graphs, either generated by a Newton graph, or the so-called nuclear Newton graph, exhibiting only one vertex and two edges). Our study results into a deeper insight in the creation of structurally stable Newton flows and the bifurcation of non-structurally stable Newton flows. As it requires the classification of all third order Newton graphs, we present this classification.


Motivation; recapitulation of earlier results
In order to clarify the context of the present paper, we recapitulate some earlier results.

Elliptic Newton flows; structural stability
The results in the following four subsections, can all be found in our paper [4].
The planar elliptic Newton flow N ( f ) is a C 1 -vector field on C, defined as a desingularized version 1 of the planar dynamical system, N ( f ), given by On a non-singular, oriented N ( f )-trajectory z(t) we have: -arg f = constant, and | f (z(t))| is a strictly decreasing function on t.
So that the N ( f )-equilibria are of the form: -a stable star node (attractor); in the case of a zero for f , or -an unstable star node (repellor); in the case of a pole for f , or -a saddle; in the case of a critical point for f (i.e., f vanishes, but f not).
For an (un)stable node the (outgoing) incoming trajectories intersect under a nonvanishing angle /k, where stands for the difference of the (arg f )-values on these trajectories, and k for the multiplicity of the corresponding (pole) zero. The saddle in the case of a simple critical point (i.e., f does not vanish) is orthogonal and the two unstable (stable) separatrices constitute the "local" unstable (stable) manifold at this saddle.
Functions such as f correspond to meromorphic functions on the torus T ( ) (= C/ ω 1 ,ω 2 ). So, we can interpret N ( f ) as a global C 1 -vector field, denoted 2 N ( f ), on the Riemann surface T ( ) and it is allowed to apply results for C 1 -vector fields on compact differential manifolds, such as certain theorems of Poincaré-Bendixon-Schwartz (on limiting sets) and those of Baggis-Peixoto (on C 1 -structural stability).
It is well known that the function f has precisely r zeros and r poles (counted by multiplicity) on the half open / half closed period parallelogram P ω 1 ,ω 2 given by t 1 ω 1 + t 2 ω 2 : 0 t 1 < 1, 0 t 2 < 1 .

The topology 0
It is not difficult to see that the functions f , and also the corresponding toroidal Newton flows, can be represented by the set of all ordered pairs This representation space can be endowed with a topology, say τ 0 , induced by the Euclidean topology on C, that is natural in the following sense: Given an elliptic function f of order r and ε > 0 sufficiently small, a τ 0 -neighborhood O of f exists such that for any g in O, the zeros (poles) for g are contained in ε-neighborhoods of the zeros (poles) for f . E r ( ) is the set of all functions f of order r on T ( ) and N r ( ) the set of corresponding flows N ( f ). By X (T ) we mean the set of all C 1 -vector fields on T , endowed with the C 1 -topology (cf. [6]).
The topology τ 0 on E r ( ) and the C 1 -topology on X (T ) are matched by: The map E r ( ) → X (T ) : f → N ( f ) is τ 0 -C 1 -continuous.

Canonical forms of elliptic Newton flows
The flows N ( f ) and N (g) in N r ( ) are called conjugate, denoted N ( f ) ∼ N (g), if there is a homeomorphism from T onto itself mapping maximal trajectories of N ( f ) onto those of N (g), thereby respecting the orientations of these trajectories. Conjugate flows are considered as equal, since we focus on qualitative aspects of the phase portraits.
Consequently, unless strictly necessary, we suppress the role of and write: E r ( ) = E r , T ( ) = T and N r ( ) = N r .

Structural stability
The flow 1.1.2. So, when discussing structurally stable toroidal Newton flows we may skip the adjectives τ 0 and C 1 .
The main results obtained in [4] are: • N ( f ) in N r iff the function f is non-degenerate 6 . [Characterization] • The set of all non-degenerate functions of order r is open and dense in the set E r . [Genericity]

Classification and representation of structurally stable elliptic Newton flows
The following three subsections describe shortly the main results from our paper [5].

The graphs G(f ) and G * (f )
For the flow N ( f ) in N r we define the connected multigraph 7 G( f ) of order r on T by: • vertices are the r zeros for f ; 4 τ satisfies Im τ > 0, |τ | 1, − 1/2 Re τ < 1/2, Re τ 0 if |τ | = 1. 5 A pair (ω * 1 , ω * 2 ) of basic periods for f * is called reduced if |ω * 1 | is minimal among all periods for f * , whereas |ω * 2 | is minimal among all periods ω for f * with the property Im ω/ω * 1 > 0. 6 i.e., all zeros, poles and critical points for f are simple, and no critical points are connected by N ( f )trajectories; the set of all such functions is denoted by E r . 7 The graph G( f ) has no loops, basically because the zeros for f are simple. The following features of G( f ) reflect the main properties of the phase portraits of N ( f ): • G( f ) is cellularly embedded, i.e., each face is homeomorphic to an open R 2 -disk; • all (anti-clockwise measured) angles at an attractor in the boundary of a face that span a sector of this face, are strictly positive and sum up to 2π ; [A-property] • the boundary of each G( f )-face-as subgraph of G( f )-is Eulerian, i.e., admits a closed facial walk that traverses each edge only once and goes through all vertices. [E-property] The anti-clockwise permutation on the embedded edges at vertices of G( f ) induces a clockwise orientation of the facial walks on the boundaries of the G( f )-faces; see Fig. 2. On its turn, the clockwise orientation of G( f )-faces gives rise to a clockwise permutation on the embedded edges at G * ( f )-vertices, and thus to an anti-clockwise orientation of G * ( f ). In the sequel, all graphs of the type G( f ), G * ( f ), are always oriented in this way, see Fig. 2. Hence, by duality, It follows that also G * ( f ) is cellularly embedded and fufills the E-and A-properties.

Newton graphs
A connected multigraph G in T with r vertices, 2r edges and r faces is called a Newton graph (of order r ) if this graph is cellularly embedded and moreover, the Eand A-properties (possibly under suitable local redrawing) hold. It is proved that the dual G * of a Newton graph G is also Newtonian (of order r ). The anti-clockwise (clockwise) permutations on the edges of G at its vertices Fig. 2 The oriented graphs G( f ) and G * ( f ) endow a clockwise (anti-clockwise) orientation of the G-faces and, successively, an anti-clockwise (clockwise) orientation of the G * -faces, cf. Fig. 2.
• Apparently G( f ) and G * ( f ) are Newton graphs.
The main results obtained in [5] are: • If N ( f ) and N (g) are structurally stable and of the same order, then [Classification] • Given a clockwise oriented Newton graph G of order r , there exists a structurally stable Newton flow N ( f G ) such that G( f G ) ∼ G and thus (H is another clockwise oriented Newton graph) Here the symbol ∼ between flows stands for conjugacy, and between graphs for equivalency (i.e., an orientation preserving isomorphism).
The graph G( f ) is, so to say, the principal part of the phase portrait of the structurally stable flow N ( f ) and determines, in a qualitative sense, the whole phase portrait; see Figs. 1 and 2 for an illustration. In accordance with our philosophy ("focus on qualitative aspects"), conjugate flows are considered as equal. Note however, that by the above classification we have: which is in general not true. 8 Nevertheless, from our point of view it is reasonable to consider the dual flows N ( f ) and N (1/ f ) as equal (since the phase portraits are equal, up to the orientation of the trajectories). So, the problem of classifying structurally stable elliptic Newton flows is reduced to the classification (under equivalency and duality) of Newton graphs.

Criteria for the A-and E-properties
Let G be a cellularly embedded multigraph of order r in T . There is a simple criterion available for G to fulfil the A-property. In order to formulate this criterion, we denote the vertices and faces of G by v i and F j respectively, i, j = 1, . . . , r . Now, let J be a subset of {1, . . . , r } and denote the subgraph of G, generated by all vertices and edges incident with the faces F j , j ∈ J , by G(J ).The set of all vertices in G(J ) is denoted by V (G(J )). Then G has the A-property where |·| stands as usual for cardinality. As a by-product we have: • Under the A-property, the set Ext(G(J )) of exterior G(J )-vertices (i.e., vertices in G(J ) that are also adjacent to G-faces, but not in G(J )), is non-empty. Let G be a cellularly embedded multigraph of order r in T . We consider the rotation system for G: where the local rotation system π v at v is the cyclic permutation of the edges incident with v such that π v (e) is the successor of e in the anti-clockwise ordering around v. Then, the boundaries of the faces of G are formally described by -walks as: If e(= (v v )) stands for an edge, with end vertices v and v , we define a -walk (facial walk), say w, on G as follows: Consider an edge e 1 = (v 1 v 2 ) and the closed walk w = v 1 e 1 v 2 e 2 v 3 · · · v k e k v 1 , which is determined by the requirement that, for i = 1, . . . , , we have π v i+1 (e i ) = e i+1 , where e +1 = e 1 and is minimal. 9

[Face transversal procedure]
Each edge occurs either once in two different -walks, or twice (with opposite orientations) in only one -walk. G has the E-property iff the first possibility holds for all -walks. The dual G * admits a loop 10 iff the second possibility occurs at least in one of the -walks. The following observation will be referred to in the sequel: • Under the E-property for G, each G-edge is adjacent to different faces; in fact, any G-edge, say e, determines precisely one G * -edge e * (and vice versa) so that there are 2r "intersections" s = (e, e * ) of Gand G * -edges.
Consider an abstract graph P(G) with vertices represented by the pairs s = (e, e * ) and by the Gand G * -vertices. Two of the vertices in P(G) are connected iff they are represented by points incident with the same edges in G or G * . P(G) admits a cellular embedding in T (cf. [5]), which will be referred to as to the distinguished graph G ∧G * with as faces the so-called canonical regions (cf. Fig. 1). Following [10], G ∧G * determines a C 1 -structurally stable flow X (G) on T . We proved that, if the A-property holds as well, X (G) is topologically equivalent with a structurally stable elliptic Newton flow of order r (cf. [5,Section 4]). By the Heffter-Edmonds-Ringel rotation principle, the graph G is uniquely determined up to an orientation preserving isomorphism by its rotation system. In fact, consider for each -walk w of length l, a so-called -polygon in the plane with l sides labelled by the edges of w, so that each polygon is disjoint from the other polygons. These polygons can be used to construct (patching them along identically labelled sides) an orientable surface S and in S a 2-cell embedded graph H with faces determined by the polygons. Then S is homeomorphic to T and H isomorphic with G. The clockwise oriented -walks of G determine a clockwise rotation system * for G * that-by the face traversal procedure-leads to anti-clockwise oriented * -walks for G * .

Classification of Newton graphs of order 3
Let G be an arbitrary Newton graph of order r , and G * its geometrical dual. The vertices and faces of G are denoted by v i , respectively by F r +i , i = 1, . . . , r . The G * -vertex "located" in F r +i is denoted by v * r +i , and the G * -face that "contains" v i by F * i . In forthcoming figures, the vertices G and G * will be indicated by their indices in combination with the symbols • and • respectively, i.e., v i ↔ • i , and v * r +i ↔ • r +i . This induces an indexation of the faces of G and G * as follows: F r +i ↔ • r +i and By assumption G does not admit loops, whereas this is also true for G * (since G has the E-property). The A-property for the Newton graphs G and G * ensures the non-existence of vertices for G and G * of degree 1.
As Newton graphs of order 3 are leading examples at our considerations how to handle non-structurally stable flows, we now present their classification using the results from [5]. In particular, we use that, since r = 3, the E-property already implies that G is a Newton graph (cf. Sect. 1.2.3). So, from now on, let G be a third order Newton graph. We denote the G-edges by a, b, c, d, e, f , and the corresponding G *edges by We distinguish between the following three possibilities with respect to the boundaries ( -walks) of G-faces: Case 1: The boundary of one of the G-faces, say ∂ F 4 , has six edges, i.e., δ * 4 = 6. Case 2: The boundary of one of the G-faces, say ∂ F 4 , has five edges, i.e., δ * 4 = 5. Case 3: Each boundary of the faces in G and G * has four edges, i.e., δ = δ * = (4, 4, 4).
By Lemma 2.1, Cases 1, 2 and 3 are mutually exclusive and cover all possibilities. First we should check whether there exist graphs G that fulfil the conditions in the above cases, and, even so, to what extent G is determined by these conditions. Ad Case 1: Because of the E-property, and since G has no loops, it is necessary for the existence of G that the -walk w F 4 of a possible face F 4 fulfils one of the following conditions: Subcase 1.1: Traversing w F 4 once, each vertex appears precisely twice. Subcase 1.2: Traversing w F 4 once, there is one vertex (say v 1 ) appearing three times, one (say v 2 ) appearing twice, and one (say v 3 ) showing up only once.
The (clockwise oriented) -polygon for ∂ F 4 has six sides, labelled a, b, . . . , f , and six "corner points", labelled by the vertices v 1 , v 2 , v 3 (repetitions necessary). Identifying points related to the same G-vertex, brings us back to w F 4 . Assume that the cyclic permutations of the edges in w F 4 that are incident with the same vertex are oriented anti-clockwise (cf. the conventions in Sect. 1.2.2). In order to ensure that a walk on the boundary of a face is a -walk one must verify that this walk begins and ends with the same vertex and that this vertex is incident with same edge. In the notation of a -walk this is stipulated by placing this edge-in the last position-between brackets, see e.g. (3) and (4).
In Subcase 1.1 there are precisely two different-up to relabelling-possibilities for w F 4 according to the schemes (see Fig. 3): or First, we focus on w F 4 given by Scheme (3), see Fig. 3 (a). In the (anti-clockwise) cyclic permutation of the w F 4 -edges, incident with the same vertex, these edges occur in pairs, determining a (positively oriented) sector of F 4 . As an edge is always adjacent to two different faces (cf. Sect. 1.2.3), two F 4 -sectors at the same v i are separated by facial sectors (at v i ) not belonging to F 4 (cf. Fig. 3 (a)). Since, moreover, the graph we are looking for, admits altogether twelve facial sectors, the cyclic permutation of  . 5 The rotation systems for G * , according to Scheme (3) the edges at v i are as indicated in Fig. 3 (a) and constitute a rotation system that-up to equivalency and relabelling-determines the graph, say G, uniquely.
With the aid of the rotation system in Fig. 3 (a) and applying the face traversal procedure, as sketched in Sect. 1.2.3, we find the closed walks v 2 av 1 cv 3 defining the two other G-faces, say F 5 , resp. F 6 . (Note that each edge occurs twice in different walks, but with opposite orientation.) Gluing together the facial polygons corresponding to F 4 , F 5 and F 6 , according to equally labelled sides and corner points, gives rise to the plane representations of G in Fig. 4

(a). [Heffter-Edmonds-Ringel]
From Fig. 4 (a) it follows that the rotation system for G * is as depicted in Fig.  5. With the aid of this figure we find, again by the face traversal procedure, the following closed subwalks in respectively. (Note that each edge occurs twice in different walks, but with opposite orientation.) Gluing together the facial polygons corresponding to these faces according to equally labelled sides and corner points, yields the plane representations of G * in Fig. 4 (a).
If we start from a -walk for F 4 , according to Scheme (4), we find (by the same argumentation as above) plane representations for G and G * ; see Fig. 4 Note that in all graphs in Fig. 4 the anti-clockwise (clockwise) orientation of the cyclic permutations of edges incident with the same vertex induces a clockwise (anticlockwise) orientation of the faces. In Subcase 1.2 there is precisely one-up to relabelling-possibility for w F 4 according to the scheme: In this case however, there are three pairs of G-edges at v 1 determining (positively measured) sectors of F 4 . So, reasoning as in Subcase 1.1, there are two possibilities for the (anti clockwise) cyclic permutations of the G-edges at v 1 (and thus also two different rotation systems; see Fig. 6). Starting from Fig. 6 (a) and applying the face traversal procedure, we find the facial , which together with Scheme (5) define the faces F 5 , F 6 and F 4 respectively. Reasoning as in Subcase 1.1, we arrive at the plane realizations of G and G * as depicted in Fig. 7 (a). In the case of Fig. 6 , together with Scheme (5), define the faces F 5 , F 6 and F 4 respectively. Reasoning as in Subcase 1.1, we obtain the plane representations for G and G * as depicted in Fig. 7 Note that both graphs G in Fig. 7 are self-dual (cf. footnote 8 or note that δ(G) = δ(G * ) and use [5,Lemma 3.5]). However, by inspection of their rotation systems, one sees that they are not equivalent (cf. Sect. 1

.2.3).
Ad Case 2: Because the -walk of F 4 has no loops and consists of an Euler trail on the five edges of G, there is only one-up to relabelling-possibility for w F 4 (see Fig.  8 (a)): In contradistinction with the previous Case 1, now there is one edge, namely f , that is not contained in w F 4 . This edge must connect either v 1 to Fig. 8 (b) where we show the part of the abstract graph P(G) underlying G ∧G * that is determined by ∂ F 4 . To begin with, we focus on the first two subcases.  Fig. 10 (c), (d) these graphs are equal w.r.t. an orientation reversing isomorphism (apply the relabelling introduced in footnote 11). Apparently, the graphs G and G * (and thus also G * and G) in Fig. 10 (a), resp. Fig. 10 (e), are equal (under an orientation preserving isomorphism). The graphs G in Fig. 10   . By inspection of the corresponding partial graph P(G), the first possibility is ruled out. So, we focus on Fig.  11 (b). Recall that two facial sectors at the same vertex v i are separated by facial sectors (at v i ) not belonging to F 4 and that in the actual case we have δ = δ * = (4, 4, 4). So, we find the rotation systems and the distribution of "local facial sectors" as depicted in Fig. 11 (b), where the roles of both e, f and F 5 , F 6 may be interchanged. Now, by the face traversal procedure we find: Apart from relabelling and equivalency, there is only one (self-dual) graph possible, Fig. 12. • Apart from conjugacy and duality, there are precisely nine possibilities for the third order structurally stable elliptic Newton flows. These possibilities are characterized by the Newton graphs in Fig. 13. • If we add to Fig. 13 the duals of the graphs in Fig. 13 (a), (b), (e), we obtain a classification under merely conjugacy, containing twelve different possibilities.

Pseudo Newton graphs
Throughout this section, let G r be a Newton graph of order r . Due to the E-property, we know that an arbitrary edge of G r is contained in precisely two different faces. If we delete such an edge from G r and merge the involved faces F 1 , F 2 into a new face, say F 1,2 , we obtain a toroidal connected multigraph (again cellularly embedded) with r vertices, 2r − 1 edges and r − 1 faces: F 1,2 , F 3 , . . . , F r .
If r = 3, the result is a graph with only one face. If r > 3, put J = {1, 2, 3}. By the same reasoning as used in the case r = 3, it can be shown that ∂ F 1,2,3 contains an edge belonging to another face than F 1 , F 2 or F 3 , say F 4 . Delete this edge and obtain the "merged face" F 1,2,3,4 . And so on. In this way, we obtain-in r − 1 steps-a connected cellularly embedded multigraph, sayǦ r , with r vertices, r + 1 edges and only one face.
Obviously,Ǧ r contains vertices of degree 2. Let us assume that there exists a vertex forǦ r , say v, with deg v = 1. If we delete this vertex fromǦ r , together with the edge incident with v, we obtain a graph with r − 1 vertices, r edges and one face. If this graph contains also a vertex of degree 1, we proceed successively. The process stops after L steps, resulting into a (connected, cellularly embedded) multigraph, say G ρ . This graph admits ρ = r − L vertices (each of degree 2), ρ + 1 edges and one face.
Apparently 12 we have: L < r − 1 and thus ρ r . In particular: If r = 2, then ρ = 2 and L = 0. If r = 3, then ρ = 3 and L = 0, or ρ = 2 and L = 1; see Fig. 15. From Fig. 14, it follows that G 2 is unique (up to equivalency). From the forthcoming Corollary 3.2 it follows that alsoǦ 2 is unique. However, a graphǦ r , r > 2, is not uniquely determined by G r , as will be clear from Fig. 15, where G 3 is a Newton graph (cf. Sect. 1.2.3 or Fig. 13 (c)).
Note that one uses here also that G ρ has ρ vertices and all these vertices have degree 2. Thus, either The geometrical dual ( G ρ ) * of G ρ has only one vertex. So, all edges of ( G ρ ) * are loops. Hence, in the facial walk w of G ρ , each edge shows up precisely twice (with opposite orientation), cf. Sect. 1.2.3. Thus w has length 2(ρ + 1). By the face traversal procedure, each facial sector of G ρ is encountered once and-at a vertex v-there are deg v many of such sectors. Application of (a 1 ) and (a 2 ) yields the second part of the assertion.  Fig. 16 The graphs G ρ first case, v 1 is both begin-and endpoint of e 1 ; in the second case, v s is both begin-and endpoint of e s . This would imply that G ρ has a loop which is excluded by construction of this graph. (c 3 ): Note that, traversing w once, each of the two vertices of degree 3 is encountered thrice. Suppose that the begin en and points of one of the subwalks W 1 , W 2 , . . . , say W 1 , coincide. Then, this also holds for the subwalk W −1 1 being-by (c 2 )-not adjacent to W 1 . So, traversing w once, this common begin/endpoint is encountered at least four times; in contradiction with our assumption. The assertion is an easy consequence of (a 1 ) and (c 2 ). (c 4 ): Traversing w once, the vertex of degree 4 is encountered four times. In view of (a 2 ) and (c 2 ), we find four closed subwalks of w namely: W 1 , W −1 1 (not adjacent) and W 2 , W −1 2 (not adjacent). Finally we note that each of these subwalks must contain at least one vertex of degree 2 (since G ρ has no loops).
An analysis of its rotation system learns that G ρ is determined by its facial walk w, and thus also by the subwalks W 1 W 2 W 3 (in case (a 1 )) or W 1 W 2 (in case (a 2 )). In fact, only the length of the subwalks W i matters.

Corollary 3.2
The graphs G 2 and G 3 can be described as follows: • By Lemma 3.1 it follows that G 2 does not have a vertex of degree 4. So, G 2 is of the form as depicted in Fig. 16- Fig. 17-each graph (on solid and dotted edges) Fig. 17 (a)-(c) are equivalent, but not equivalent with the graph on solid edges in Fig. 17 (d). In a similar way it can be proved that the graphs in Fig. 17 expose all possibilities (up to equivalency) for G 3 .

Definition 3.3 (Pseudo Newton graphs)
Cellularly embedded toroidal graphs, obtained from G r by deleting edges and vertices in the way as described above, are called pseudo Newton graphs (of order r ).
Apparently, a pseudo Newton graph is not a Newton graph by itself. The only second order pseudo Newton graph is G 2 (=Ǧ 2 ); see Figs. 14 and 16-a 1 (with W i single edges). In the case of third order pseudo Newton graphs (L = 0 or 1) we have: • If L = 1, the graphǦ 3 admits a vertex v of deg 1. Deleting v together with the adjacent edge e, we obtain the unique graphǦ 2 . The two possibilities for the originalǦ 3 (caused by how e is attached toǦ 2 ) are mutually equivalent (as follows from their rotation systems). By inspection (see Fig. 13 (d)), we find out that our graph is Newtonian indeed. • If L = 0 the graphǦ 3 is of the type G 3 so that by Corollary 3.2 there are two different possibilities (see Fig. 17 (a), (d)), both being Newtonian. This is used further on; see Fig. 24 where we pictured these three possibilities.

Remark 3.4
If we delete from G ρ an arbitrary edge, the resulting graph remains connected, but the "alternating sum of vertices, edges and face" equals +1. Thus one obtains a graph that is not cellularly embedded.

Definition 3.5 A nuclear Newton graph is a cellularly embedded graph in T with one vertex and two edges.
Apparently a nuclear Newton graph is connected and admits one face and two loops.
In particular such a graph has a trivial rotation system. Hence, all nuclear Newton graphs are topologically equivalent and since they expose the same structure as the pseudo Newton graphs G ρ , they will be denoted by G 1 . Note that a nuclear Newton graph fulfils the A-property (but certainly not the E-property). Consequently, a graph of the type G 1 is not a Newton graph. Nevertheless, nuclear Newton graphs will play an important role because, in a certain sense, they "generate" certain structurally stable Newton flows. This will be explained in the sequel. We may assume that a, b are not on the boundary ∂ P of P. Since the period pair (1, i) is reduced, the images under f of the P-sides γ 1 and γ 2 are closed Jordan curves (use the explicit formula for λ 0 as presented in footnote 3). From this, we find that the winding numbers η( f (γ 1 )) and η( f (γ 2 )) can-a priori-only take the values −1, 0 or The remaining combinations lead, for each value of r = 2, 3, . . . , to eight different values for b each of which giving rise, together with a, to eight pairs of classes mod that fulfil (1), determining flows in N r ( ), cf. Fig. 18, where we assumed-under a suitable translation of P-that a = 0.
Note that the derivative f is elliptic of order r + 1. Since there is on P only one zero for f (of order r ), the function f has two critical points, i.e., saddles for N ( f ), counted by multiplicity.
The eight pairs (a, b) that possibly determine a nuclear Newton flow are subdivided into two classes, each containing four configurations (a, b) (see Fig. 19): Class 1: a = 0, b on a side of the period square P.
Class 2: a = 0, b on a diagonal of the period square P, but not on ∂ P. The configuration (a, b), a = 0, b = 1/r : The line 1 between 0 and 1, and the line 2 between i/2 and 1+i/2, are axes of mirror symmetry with respect to this configuration (cf. Fig. 20 (a)). By the aid of this symmetry and using the double periodicity of the supposed flow, it is easily proved that this configuration cannot give rise to a desired nuclear Newton flow.
The configuration (a, b), a = 0, b = (1 + i)/r : The line between 0 and (1 + i)/2 is an axis of mirror symmetry with respect to this configuration (cf. Fig. 20 (b)). So the two saddles of the possible nuclear Newton flow are situated either on the diagonal of P through (1 + i)/r , or not on this diagonal but symmetric with respect to 1 . The first possibility can be ruled out (by the aid of the symmetry w.r.t. and using the double periodicity of the supposed flow). So it remains to analyze the second possibility. (Note that only in the case where r = 2, also the second diagonal of P yields an axis of mirror symmetry.) We focus on Fig. 21, where the only relevant configuration determining a (planar) flow N ( f ), is depicted. By symmetry, the -segments between 0 and (1 + i)/r , and between (1 + i)/r and 1 +i are N ( f )-trajectories connecting the pole (1 + i)/r , with the zeros 0 and 1 + i. Since on the N ( f )-trajectories the arg f values are constant, we may arrange the argument function on C so that on the segment between (1 + i)/r and 1 + i we have arg f = 0. We put arg f (σ 1 ) = α, thus 0 < α < 1 and arg f (σ 2 ) = −α. Note that at the zero / pole for f , each value of arg f appears r times on equally distributed incoming (outgoing) N ( f )-trajectories. By the aid of this observation, together with the symmetry and periodicity of f , we find out that the phase portrait of N ( f ) is as depicted in Fig. 21, where the entries in the boxes stand for the constant   Fig. 21 rely on the values of r and α. Put β = 1/2 + α − 1/r and γ = 1/r − 2α. Since all angles α, β and γ are strictly positive, we have 0 < α < 1/(2r ). Note that if r = 2, by symmetry w.r.t. both the diagonals of P, we have α = β = 1/8; γ = 1/4, see Fig. 22; in this case N ( f ) is just N (℘), with ℘ the Weierstrass' ℘-function (lemniscate case, cf. [1]). This is also clear from Fig. 18, cf. also [3].
Altogether we conclude: For f an elliptic function of order r with-on T -only one zero and pole we now define: • the zero for f on T (as attractor for N ( f )); • the unstable manifolds for N ( f ) at the two critical points for f ; • the basin of repulsion for N ( f ) of a pole for f on T (as a repellor for N ( f )).
From Fig. 21 it is evident that H r ( f ) is a cellularly embedded pseudo graph (loops and multiple edges permitted). This graph is referred to as to the nuclear Newton graph for N ( f ). By Lemma 4.2, the graphs H r ( f ), are-up to equivalency-unique, and will be denoted by H r (cf. the comment on Definition 3.5).
If a, b (both in P (= P 1,i )) are of Class 2 (i.e., the configuration (a, b) determines a nuclear flow with a and b as zero resp. pole of order r ), we introduce the doubly periodic functions: where the summation takes place over all points in lattice (= 1,i ). We define the planar flow N ( f ) by  Proof Let N ( f ) be arbitrary. Because all its equilibria are generic and there are no saddle connections, this flow is C 1 -structurally stable. The embedded graph H r (= H r ( f )), together with its geometrical dual H r ( f ) * , forms the so-called distinguished graph that determines-up to an orientation preserving homeomorphism-the phase portrait of N ( f ) (cf. [10,11] and Sect. 1.2.3). This distinghuished graph is extremely simple, giving rise to only four distinghuished sets (see Fig. 21). This holds for any flow of the type N ( f ). Now, application of Peixoto's classification theorem for C 1 -structurally stable flows on T yields the assertion.
We end up with a comment on the nuclear Newton graph H( f ω 1 ,ω 2 ), Im ω 2 /ω 1 > 0, where (ω 1 , ω 2 ), is related to the period pair (1, i) by the unimodular transformation Thus ( p 1 , p 2 ) and (q 1 , q 2 ) are co-prime, and Our aim is to describe H( f ω 1 ,ω 2 ) as a graph on the canonical torus T (= T 1,i ). In view of Lemma 4.2, the two edges of H( f ω 1 ,ω 2 ) are closed Jordan curves on T , corresponding to the unstable manifolds of N ( f ω 1 ,ω 2 ) at the two critical points for f that are situated in the period parallelogram P ω 1 ,ω 2 . These unstable manifolds connect a (= 0) with p 1 + p 2 i, and q 1 + q 2 i respectively. Hence, one of the H( f ω 1 ,ω 2 )-edges wraps p 1 times around T in the direction of the period 1 and p 2 times around T in the direction of the period i, whereas the other edge wraps q 1 times around this torus in the 1-direction respectively q 2 times in the i-direction. See also Fig. 23, where we have chosen for f the Weierstrass ℘-function (lemniscate case), i.e., r = 2, a = 0 and ω 1 = 3 + i, ω 2 = 2 + i. Compare also Fig. 22. Fig. 24 The three different pseudo Newton graphsǦ 3 , G 3 From now on, we assume that N (g) is structurally stable and define the multigraph G r (g) on T as follows: • Vertices: r zeros for g (i.e., stable star nodes for N (g)).
• Edges: r + 1 unstable manifolds at the critical points for g (orthogonal saddles for N (g)).
• Face: the basin of repulsion of the unstable star node at the pole for g.
Note that G r (g) has no loops (since the zeros for g are simple). It is easily seen that G r (g) is cellularly embedded (cf. [5, proof of Lemma 2.9]). Because G r (g) has only one face, the geometrical dual G r (g) * admits merely loops and the -walk for the G r (g)face consists of 2(r + 1) edges, each occurring twice, be it with opposite orientation; here the orientation on the -walk is induced by the anti-clockwise orientation on the embedded G r (g) * -edges at the pole for g. In the case where G r (g) admits a vertex of degree 1, we delete this vertex together with the adjacent edge, resulting into a cellularly embedded graph on r − 1 vertices, r edges and only one face. If this graph has a vertex of degree 1, we repeat the procedure, and so on. The process stops after L (<r − 1) steps, resulting into a connected, cellularly embedded multigraph with ρ(= r − L) vertices (merely of degree > 1), ρ edges and one face. Now, we ask whether the graphs G r (g), g ∈ E 1 r , are indeed pseudo Newtonian, i.e., do they originate from a Newton graph? And even so, can all pseudo Newton graphs be represented by elliptic Newton flows?
In the sequel we present an (affirmative) answer to these questions in the cases r = 2, 3.
Lemma 5.1 If r = 2 or 3, then G r (g), g ∈ E 1 r , is a pseudo Newton graphǦ r .
Proof Firstly we note that from the proof of Lemma 3.1 it follows: Any cellularly embedded graph with two vertices (merely of degree > 1), three edges and one face, must be equivalent with G 2 ; if this graph has three vertices (merely of degree > 1), four edges and one face, it must be equivalent with the graphs in either Fig. 17 (a) or (d) (solid edges).
Case r = 2: If there is a vertex of degree 1, then two (of the three) edges would connect the other vertex to itself. This is impossible sinceǦ 2 (g) does not admit loops. By our preambule, G 2 (g) is equivalent with the unique (cf. Sect. 2) pseudo Newton graph G 2 (=Ǧ 2 ).
Case r = 3: If all vertices have degree > 1, we apply our preambule and find the pseudo Newton graphs in Fig. 24 (b), (c) as possibilities. If v is a vertex of degree 1, we delete v together with its adjacent edge and distinguish between: (i) The resulting graph has again a vertex of degree 1. Then two (of the four edges) would connect the third vertex to itself, which is impossible because G 2 (g) has no loops.
(ii) The resulting graph has no vertices of degree 1. Applying our preambule to the original G r (g), we find that the latter graph is pseudo Newtonian as depicted in Fig. 24 (a).
(Note that in Fig. 24 the values of degree v i discriminate between the three possibilities.) The above reasoning in the case r = 3 does not imply that each of the graphs in Fig.  24 can be realized by a Newton flow. So we need Lemma 5.2 If r = 2 or 3, then each pseudo Newton graph of the typeǦ r or G r can be realized as G r (g), g ∈ E 1 r . Proof r = 2: Follows from the proof of Lemma 5.1.  Fig. 21 is depicted in the forthcoming Fig. 26. Recall that v is the only zero for f and a star node for N ( f ); also α > 0, α + γ = 1/r − α and α + β + γ = 1/2. Thus we have: β > 1/(2r ) so that the combined angle β + β in Fig. 26 spans an arc greater than 1/r (= 1/3). Now the idea is: To split off from the third order zero v for f a simple zero (v 1 ) ("Step 1"), and thereupon, to split up the remaining double zero (v 1 ) into two simple ones (v 2 , v 3 ) ("Step 2"), in such a way that by an appropriate strategy, the resulting functions give rise to Newton flows with associated graphs, determining each of the three possible types in Fig. 24. Ad Step 1: We perturb the original function f into an elliptic function g with one simple (v 1 ) and one double (v 1 ) zero (close to each other), and one third order pole w 1 (thus close 13 to the third order pole w of f ). The original flow N ( f ) perturbs into a flow N (g) with v 1 and v 1 as attractors and w 1 as repellor. When v 1 tends to v 1 , the perturbed function g will tend to f , and thus the perturbed flow N (g) to N ( f ), cf. Sect. 1.1.2. In particular, when the splitted zeros are sufficiently close to each other and the circle C 1 that encloses an open disk D 1 with center v 1 , is chosen sufficiently small, C 1 is a global boundary (cf. [7]) for the perturbed flow N (g). It follows that, apart from the equilibria v 1 and v 1 (both of Poincaré index 1) the flow N (g) exhibits on D 1 one other equilibrium (with index −1): a simple saddle, say c (cf. [2]). From this, it follows (cf. Sect. 1.1.1) that the phase portrait of N (g) around v 1 and v 1 is as sketched in Fig. 25 (a), where the local basin of attraction for v 1 is shaded and intersects C 1 under an arc with length approximately 1/3.
On the (compact!) complement T \D 1 this flow has one repellor (w 1 ) and two saddles. The repellor may be considered as hyperbolic (by the suitably chosen damping factor, cf. the proof of Lemma 4.4), whereas the saddles are distinct and thus simple (because N ( f ) has two simple saddles, say σ 1 , σ 2 , depending continuously on v 1 and v 1 ). Hence, the restriction of N (g) to T \D 1 is ε-structurally stable (cf. [10]). So, we may conclude that, if v 1 (chosen sufficiently close to v 1 ) turns around v 1 , the phase portraits outside D 1 of the perturbed flows undergo a change that is negligible in the sense of the C 1 -topology. Therefore, we denote the equilibria of N (g) on T \D 1 by w 1 , σ 1 , σ 2 (i.e., without reference to v 1 ). We move v 1 around a small circle, centered at v 1   Step 2: We proceed as in Step 1. Splitting v 1 into v 2 and v 3 (sufficiently close to each other) yields a perturbed elliptic function h, and thus a perturbed flow N (h). Consider a circle C 2 , centered at the mid-point of v 2 and v 3 , that encloses an open disk D 2 containing these points. If we choose C 2 sufficiently small, it is a global boundary of N (h). Reasoning as in Step 1, we find out that N (h) has on D 2 two simple attractors (v 2 , v 3 ) and one simple saddle: d (close to the mid-point of v 2 and v 3 ; cf. Fig. 25 (b)), where the local basin of attraction for v 3 is shaded and intersects C 2 under an arc with length approximately 1/2. Moreover, as for N (g) in Step 1, the flow N (h) is ε-structurally stable outside D 2 . So, we may conclude that, if v 2 and v 3 turn (in diametrical position) around their mid-point, the phase portraits outside D 2 of the perturbed flows undergo a change that is negligible in the sense of C 1 -topology. Therefore, we denote the equilibria of N (h) on T \D 2 by v 1 , w 1 , c, σ 1 , and σ 2 (i.e., without reference to v 2 and v 3 ).
Finally, for v 1 in the position of Fig. 27(I) we choose the pair (v 2 , v 3 ) as in Fig.  28(I); and for v 1 in the position of Fig. 27(II), we distinguish between two possibilities: Fig. 28 (IIa) and (IIb). Note that, with these choices of v 1 , v 2 , v 3 each of the obtained functions has three simple zeros and one triple pole. Moreover, the four saddles are simple and not connected, whereas the three zeros are simple as well. So the graph of the associated Newton flow is well defined and has only one face, four edges and three vertices. Recall that the various values of degree v i discriminate between the three possibilities for the graphs of typeǦ 3 ). Now inspection of Fig. 28 yields the assertion. Up till now, we paid attention to pseudo Newton graphs with only one face (i.e., of typeǦ r or G r , r = 2, 3). If r = 2, these are the only possibilities.
If r = 3, there are also pseudo Newton graphs (denoted by G) with two faces and angles summing up to 1 or 2. When the boundaries of any pair of the original G 3 -faces have a subwalk in common, these walks have length 1 or 2. (Use the A-property and cf. Fig. 13.) So, when two G 3 -faces are merged, the resulting G-face admits either only vertices of degree 2 or one vertex of degree 1. 14 From now on, we focus on the Newton graphs as exposed in Fig. 13 (a), (d) (since all other Newton graphs (in Fig. 13) can be dealt with in the same way, there is no loss of generality). Then the two G-faces We consider the distinguished graph G ∧G * of G and its dual G * , see Sect. 1.2.3. Following Peixoto [10,11] we claim that G ∧G * determines a C 1 -structurally stable toroidal flow X (G) with canonical regions as depicted 15 in Fig. 30. As equilibria for X (G) we have: three stable and two unstable proper nodes (corresponding to the Gresp. G * -vertices) and five orthogonal saddles (corresponding to the pairs (e, e * ) of Gand G * -edges). Basically arguing as in our paper [5] (proof of Theorem 4.1), it can be shown that X (G) is equivalent with an elliptic Newton flow generated by a function on three simple zeros, one double and one simple pole and five simple critical points; cf. 16 Figure 30. As an elliptic Newton flow, X (G) is not (τ 0 -)structurally stable, since G is not Newtonian, cf. Sect. 1.2.2. However, by the aid of a suitably chosen damping factor, cf. Lemma 4.4 (preambule), and within the class N 2 3 of all elliptic Newton flows generated by the class E 2 3 of functions on three simple zeros, on one double and one simple pole and on five simple critical points, the structurally stable species constitute a τ 0 -open and -dense subset ( E 2 3 ) of E 2 3 .