Quoting Ralf Hemmecke <r...@hemmecke.org>:
But if the coefficients are modulo n, how to specify this?
Does that help?
http://axiom-wiki.newsynthesis.org/SandBoxPolynomialOverFiniteField
[...]
It looks, like if it is going into the right directions
FiniteField looks good, maybe FiniteRing also available?
What I'm looking for, is polynoms with modulo-coefficients.
Say Z_2 = { 0, 1 }
And the coefficients a_i of a polynom e.g. a2 * t^2 + a1 * t + a0
can only have values of 0 an 1, which are the representations of
aequivalence classes.
So, -1 = 1, -2 = 0, 2 = 0, 3 = 1, 4 = 0, and so on
Aequivalence classes in Z2 (LaTeX: \mathbb{Z}_2)
...
-4 -3
-2 -1
0 1
2 3
4 5
6 7
....
And 0 and 1 are the usual representations of these classes.
And the coefficients can have only values from these classes.
So, it bahaves as if they can have only values 0 and 1.
In Z_3, it would be 0,1,2
in Z_4, it would be 0,1,2,3
...
any ideas about that?
_______________________________________________
Axiom-math mailing list
Axiom-math@nongnu.org
https://lists.nongnu.org/mailman/listinfo/axiom-math
