The problem of finding the roots of a polynomial can be restated as an inverse problem for a repiodic directed graph.

The boundary data consists of values of the elementary symmetric functions of the roots *a,b,c,d*.

The problem of finding the roots of a polynomial can be restated as an inverse problem for a repiodic directed graph.

The boundary data consists of values of the elementary symmetric functions of the roots *a,b,c,d*.