1 research outputs found
Gröbner Bases of Ideals Invariant under a Commutative Group: the Non-Modular Case
International audienceWe propose efficient algorithms to compute the Gröbner basis of an ideal globally invariant under the action of a commutative matrix group , in the non-modular case (where doesn't divide ). The idea is to simultaneously diagonalize the matrices in , and apply a linear change of variables on corresponding to the base-change matrix of this diagonalization. We can now suppose that the matrices acting on are diagonal. This action induces a grading on the ring , compatible with the degree, indexed by a group related to , that we call -degree. The next step is the observation that this grading is maintained during a Gröbner basis computation or even a change of ordering, which allows us to split the Macaulay matrices into submatrices of roughly the same size. In the same way, we are able to split the canonical basis of (the staircase) if is a zero-dimensional ideal. Therefore, we derive \emph{abelian} versions of the classical algorithms , or FGLM. Moreover, this new variant of allows complete parallelization of the linear algebra steps, which has been successfully implemented. On instances coming from applications (NTRU crypto-system or the Cyclic-n problem), a speed-up of more than 400 can be obtained. For example, a Gröbner basis of the Cyclic-11 problem can be solved in less than 8 hours with this variant of . Moreover, using this method, we can identify new classes of polynomial systems that can be solved in polynomial time