Given positive, negative and zero number, how to generate a Cayley table?
This is how you would do it with Grassmann.jl v0.8
julia> using Grassmann
julia> cayley(S"+++")
8Γ8 Matrix{TensorTerm{β¨+++β©}}:
v vβ vβ vβ vββ vββ vββ vβββ
vβ 1v vββ vββ 1vβ 1vβ vβββ 1vββ
vβ -1vββ 1v vββ -1vβ -1vβββ 1vβ -1vββ
vβ -1vββ -1vββ 1v vβββ -1vβ -1vβ 1vββ
vββ -1vβ 1vβ vβββ -1v -1vββ 1vββ -1vβ
vββ -1vβ -1vβββ 1vβ 1vββ -1v -1vββ 1vβ
vββ vβββ -1vβ 1vβ -1vββ 1vββ -1v -1vβ
vβββ 1vββ -1vββ 1vββ -1vβ 1vβ -1vβ -1v
Where cayley(::Signature)
takes any Signature
as an argument (e.g. S"+++"
or S"-+++"
).
Thanks, but how to do this without a library in arbitrary language? What is algorithm?
Whatβs the difference between v and 1v? And what does other cases of 1-prefixing mean?
Consider \{t_j\}_{j=1}^{2^n} = \{1, v_1, v_2, \dots, v_n, v_{12}, \dots, v_{12\dots n} \}, then t_{j,k} := t_jt_k (geometric product).
A prefix of one means multiplication by the integer 1, which is an identity operation, so v = 1v.
I donβt understand.
How to know the result of t_jt_k?
Itβs the geometric product of t_j and t_k, the definition of which depends on the choice of metric tensor.
I made a pdf with a O(log2 n) algorithm for the blade product, but I know no way to upload files to the forum.