On the complexity of invariant polynomials under the action of finite reflection groups

03/08/2022
by   Thi Xuan Vu, et al.
0

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

page 1

page 2

page 3

page 4

research
03/30/2022

Computing critical points for algebraic systems defined by hyperoctahedral invariant polynomials

Let 𝕂 be a field of characteristic zero and 𝕂[x_1, …, x_n] the correspon...
research
09/27/2016

Some results on counting roots of polynomials and the Sylvester resultant

We present two results, the first on the distribution of the roots of a ...
research
02/01/2020

Efficient q-Integer Linear Decomposition of Multivariate Polynomials

We present two new algorithms for the computation of the q-integer linea...
research
09/02/2020

Computing critical points for invariant algebraic systems

Let 𝐊 be a field and ϕ, 𝐟 = (f_1, …, f_s) in 𝐊[x_1, …, x_n] be multivari...
research
09/21/2018

New bounds and efficient algorithm for sparse difference resultant

Let P={P_0,P_1,...,P_n} be a generic Laurent transformally essential sys...
research
07/21/2022

On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts

We say that two given polynomials f, g ∈ R[X], over a ring R, are equiva...
research
09/11/2020

Guessing Gröbner Bases of Structured Ideals of Relations of Sequences

Assuming sufficiently many terms of a n-dimensional table defined over a...

Please sign up or login with your details

Forgot password? Click here to reset