English

Newton flows for elliptic functions II Structural stability: Classification & Representation

Dynamical Systems 2016-09-07 v1 Combinatorics Complex Variables

Abstract

In our previous paper we associated to each non-constant elliptic function ff on a torus TT a dynamical system, the elliptic Newton flow corresponding to ff. We characterized the functions for which these flows are structurally stable and showed a genericity result. In the present paper we focus on the classification and representation of these structurally stable flows. The phase portrait of a structurally stable elliptic Newton flow generates a connected, cellularly embedded, graph G(f)\mathcal{G}(f) on a torus TT with rr vertices, 2rr edges and rr faces that fulfil certain combinatorial properties ( Euler, Hall) on some of its subgraphs. The graph G(f)\mathcal{G}(f) determines the conjugacy class of the flow. [classification] A connected, cellularly embedded toroidal graph G\mathcal{G} with the above Euler and Hall properties, is called a Newton graph. Any Newton graph G\mathcal{G} can be realized as the graph G(f)\mathcal{G}(f) of the structurally stable Newton flow for some function ff. This leads to: up till conjugacy between flows and (topological) equivalency between graphs, there is a one to one correspondence between the structurally stable Newton flows and Newton graphs, both with respect to the same order rr of the underlying functions ff.[representation] Finally, we clarify the analogy between rational and elliptic Newton flows, and show that the detection of elliptic Newton flows is possible in polynomial time.

Keywords

Cite

@article{arxiv.1609.01323,
  title  = {Newton flows for elliptic functions II Structural stability: Classification & Representation},
  author = {G. F. Helminck and F. Twilt},
  journal= {arXiv preprint arXiv:1609.01323},
  year   = {2016}
}

Comments

34 pages, 23 figures

R2 v1 2026-06-22T15:40:35.699Z