The main goal of this paper is to extend the approximation theorem of contiuous functions by Haar polynomials (see Theorem A) to infinite matrices (see Theorem C). The extension to the matricial framework will be based on the one hand on the remark that periodic functions which belong to$L$^{∞}($T$) may be one-to-one identified with Toeplitz matrices from$B$($l$_{2}) (see Theorem 0) and on the other hand on some notions given in the paper. We mention for instance:$ms$—a unital commutative subalgebra of$l$^{∞},$C$($l$_{2}) the matricial analogue of the space of all continuous periodic functions$C$($T$), the matricial Haar polynomials, etc.

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.

No abstract uploaded!

No abstract uploaded!

No abstract uploaded!