Hi!

I want to work with polynomials over galois fields (finite fields). Useing the standard operations for galois fields from the GF package gets really unreadable for lenghly polynomials, so i am looking for something more legible. I think the nicest way would be to define polynomials in a standard way, e.g. y:= x_1+x_2^2 and than later on decide that x_1 and x_2 are elements from a finite field. However i found no way to do this.

But there should be at least two ways to make the polynomials more legible:

Hello!

1) I want to transform a polynomial in variables x_1, ... , x_n into function K^n -> K

Example:

given y[10] := x[10]+x[1]^2+x[2]*x[5]+x[3]*x[8]

i want to view y[10] as a function and evaluate it at point (x_1, ..., x_n)

2) Given m such polynomials y[i] I want to define a funktion K^n -> K^m by viewing every y[i] as a coordinate function

Example:

f:=(y[1],...,y[m]) every y[i] beeing a polynomial in x_1, ..., x_n