On the complexity of invariant polynomials under the action of finite reflection groups
Let š[x_1, ā¦, x_n] be a multivariate polynomial ring over a field š. Let (u_1, ā¦, u_n) be a sequence of n algebraically independent elements in š[x_1, ā¦, x_n]. Given a polynomial f in š[u_1, ā¦, u_n], a subring of š[x_1, ā¦, x_n] generated by the u_i's, we are interested infinding the unique polynomial f_ new in š[e_1,ā¦, e_n], where e_1, ā¦, e_n are new variables, such that f_new(u_1, ā¦, u_n) = f(x_1, ā¦, x_n). We provide an algorithm and analyze its arithmetic complexity to compute f_new knowing f and (u_1, ā¦, u_n).
READ FULL TEXT