Maple needs better user-level facilities for doing linear algebra over finite fields, particularly the integers mod n. For example there is no good way to solve a linear system Ax=B when B is a matrix. Obviously the LinearAlgebra:-Modular package is very good at what it does. Why can't there be some nice non-programmer routines which call it ? One alternative to using the mod operator is to have all the commands in the main LinearAlgebra package accept an optional last argument for the characteristic. For example: LinearAlgebra:-GaussianElimination(A, n); Then in the GaussianElimination command you could do something like: char := `if`(type(args[-1], 'posint'), args[-1], 0); and later: if char > 0 then ...set up and call LinearAlgebra:-Modular:-RowReduce

Please Wait...