Waldek,
> I have now tried your code. There is a problem in non-diagonal case:
OK, thanks, I'll look into this.
It works for Clifford multiplication based on 2D vectors so it looks like
there is a problem with the way that it is called recursively for higher
dimensional cases.
Martin Baker
----------------------------------------------
(1) -> Pf := PrimeField(17)
(2) -> bL := matrix([[1,1],[0,1]])$SquareMatrix(2,PrimeField(17))
(3) -> Ca := CliffordAlgebra(2,Pf,bL)
(4) -> randc() == reduce('+, [random()$Pf*eFromBinaryMap(i)$Ca for i in 0..3])
(5) -> a := randc()
(5) 10 + 3e + e + 4e e
1 2 1 2
(6) -> b := randc()
(6) 15 + 2e + 16e + 2e e
1 2 1 2
(7) -> c := randc()
(7) 12 + 6e + 9e e
1 1 2
(8) -> (a*b)*c - a*(b*c)
(8) 0
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
