Now thinking about the "reductum(0)=0" assumption.
I can easily remove it from my code (see below).
tailReduce(x: X, basis: List X): X ==
empty? basis => x
p: R := polynomial x
-- We iterate over the non-leading terms of polynomial(x).
r: R := 0
v: V :=
>> https://github.com/hemmecke/fricas/commit/1ea2f36f0a2bf8dd251cbb0fb6ab810b734d2c88.patch
>>
>
> Looks good. However, comment:
>
> -- Reduce the non-leading terms of x (which is assumed to be non-zero).
>
>
> looks strange:
>
> Hello,
>
> I'm currently preparing an article that involves GrĂśbner basis
> computation and then finding the representation of some polynomial in
> terms of that GrĂśbner basis. Doing this in FriCAS, is, of course, easy,
> but I was unable to find that such an extended reduction is already
>
Hello,
I'm currently preparing an article that involves Gröbner basis
computation and then finding the representation of some polynomial in
terms of that Gröbner basis. Doing this in FriCAS, is, of course, easy,
but I was unable to find that such an extended reduction is already
implemented in Fri
