GF(2). gf2.tst has two rather simple tests. The first give a terminating
calculation but I am not sure that it has added eveything it should have.
The second gets stuck and a crude resource limit I have in there stops
it from running forever. However the state things are in seems to me such
that if anybody wanted to explore the use of Reduce for work with a
distributed representation of polynomials over GF(2) this might provide
a useful starting point where they could copy and modify parts of my code
to do just what they wanted. Well I have not coded up the term-GCD and
term-LCM operators for use when a dense representation is in use, and as
I have already indicated the code for a form of Buchberger's algorithm is
both naive and buggy! So this is a KIT not a fully usable chunk of code and
any more work on it would await real applications.
It would be perfectly in order to add code here to do linear algebra or
other things beyond Groebner base stuff. And if anybody wants to pick up from
here to get this to a state where it can solve genuine problems I will help
subject to delay when I am travelling!
