In the same sense as #6, it would be good to have some polynomial based graphs which are generated by calls to general_poly_recursion. Note that general_poly_recursion includes all polynomial based methods, e.g., for the monomial evalutation with coefficients c would be

x[1]=([0 1], [0 1])
x[2]=([0 0 1], [0 1 0])
x[3]=([0 0  0 1], [0 1 0 0])
...
x[p]=([0 .... 0 1],[0 1 0 ... 0](
z=c 
gen_general_poly_recursion(x,z)

Polynomial methods that can get equivalent alternative implementations:

• gen_monomial -> gen_monomial_recursive
• gen_horner -> gen_horner_recursive
• gen_newton_schulz (still in dropbox) -> gen_newton_schulz_recursive

This is useful since we can the freedom of the additional coefficients (which are zero) can be used as graphs and initialization coefficients for GN.