This paper introduces a new efficient algorithm, called MXL_3, for computing Gröbner bases of zero-dimensional ideals. The MXL_3 is based on XL algorithm, mutant strategy, and a new sufficient condition for a set of polynomials to be a Gröbner basis. We present experimental results comparing the behavior of MXL_3 to F_4 on HFE and random generated instances of the MQ problem. In both cases the first implementation of the MXL_3 algorithm succeeds faster and uses less memory than Magma’s implementation of F_4.

The modules of principal parts$P$^{$k$}($E$) of a locally free sheaf ε on a smooth scheme$X$is a sheaf of$O$_{$X$}-bimodules which is locally free as left and right$O$_{$X$}-module. We explicitly split the modules of principal parts$P$^{$k$}($O$($n$)) on the projective line in arbitrary characteristic, as left and right$O$_{p1}-modules. We get examples when the splitting-type as left module differs from the splitting-type as right module. We also give examples showing that the splitting-type of the principal parts changes with the characteristic of the base field.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!