Take $g(X) = X^3 + X^2 - X + 1$ and let it be over $\mathbb{Z}_3$, what is usually the domain of $g$?
Grazie.
Edit: What I want to do is come up with an intelligent way t think of all the polynomials of a certain form, say $VW + XY + Z^2$ (this time in $(\mathbb{Z}_2$ or $\mathbb{Z})[V,W,X,Y,Z]$), but generalize that "form" slightly by looking at other polynomials that are "like" it. So first I'm looking at the rings of polynomials. To restrict the size of the ring I'm thinking a ring mod $X^q - 1$ (or whatever a corresponding multivariate modulus would be). So all the possible poly expressions are listable on a computer in decent time.
I figure a smart way might involve looking at factors of these expressions if I'm dealing with rational poly expressions: $P(V,\ldots,Z) / Q(V,\ldots,Z)$. I don't want to observe one possibility more than once.
Other things might make equal polys in this "set of polys that I'm interested in" like rearrangement of terms, and possibly permutations of the variables.
Once I have all this down. Then what we have is a likely set of expressions in which we might find a Somos Sequence
This is all obvious, but would be good practice for me (a novice programmer) to do. But if anyone else has already done this, I shouldn't bother. So if anyone knows, please post a link.
Thanks.