Newton flows for elliptic functions III Classification of $3^{\text{rd}}$ order Newton graphs

TL;DR

This paper classifies all third-order Newton graphs, which represent structurally stable elliptic Newton flows, providing a complete list of possible flows of this order based on combinatorial properties.

Contribution

It provides a complete classification of all third-order Newton graphs, linking combinatorial graph properties to elliptic Newton flows.

Findings

Nine possible third-order Newton flows identified

Complete list of third-order Newton graphs established

Classification aids understanding of elliptic Newton flows

Abstract

A Newton graph of order $r( \geqslant 2)$ is a cellularly embedded toroidal graph on $r$ vertices, $2r$ edges and $r$ faces that fulfils certain combinatorial properties (Euler, Hall). The significance of these graphs relies on their role in the study of structurally stable elliptic Newton flows - say $\bar{\bar{\mathcal{N}}} (f)$ - of order $r$, i.e. desingularized continuous versions of Newton's iteration method for finding zeros for an elliptic function $f$ (of order $r$). In previous work we established a representation of these flows in terms of Newton graphs. The present paper results into the classification of all $3^{\text{rd}}$ order Newton graphs, implying a list of all nine possible $3^{\text{rd}}$ order flows $\bar{\bar{\mathcal{N}}} (f)$ (up to conjugacy and duality).