I think I have restated graph isomorphism as a system of equations using symmetric polynomials. Here's a brief overview of the idea:
http://www.samplesizeofone.com/
Note, details are left out, but none of the ideas are particularly complex. I'm looking for gentle feedback, including if this formulation is valid, is reasonably easy to follow, and/or has been discussed before. Thanks :-)
Tyler samplesizeofone@gmail.com