cp's OEIS Frontend

A323100 Square array read by ascending antidiagonals: T(p,q) is the number of bases e such that e^2 = -1 in Clifford algebra Cl(p,q)(R).

%I A323100 #46 Jun 19 2019 09:31:23
%S A323100 0,0,1,1,1,3,4,2,4,6,10,6,6,10,10,20,16,12,16,20,16,36,36,28,28,36,36,
%T A323100 28,64,72,64,56,64,72,64,56,120,136,136,120,120,136,136,120,120,240,
%U A323100 256,272,256,240,256,272,256,240,256,496,496,528,528,496,496,528,528,496,496,528
%N A323100 Square array read by ascending antidiagonals: T(p,q) is the number of bases e such that e^2 = -1 in Clifford algebra Cl(p,q)(R).
%C A323100 Cl(p,q)(R) is a 2^(p+q)-dimensional algebraic structure generated by {e_1, e_2, ..., e_(p+q)}, where (e_1)^2 = (e_2)^2 = ... = (e_p)^2 = +1, (e_(p+1))^2 = (e_(p+2))^2 = ... = (e_q)^2 = -1, (e_i)*(e_j) = -(e_j)*(e_i) for any i != j (anti-commutativity), ((e_i)*(e_j))*(e_k) = (e_i)*((e_j)*(e_k)) for any i, j, k (associativity). So the 2^(p+q) basis are all elements of the form Product_{s=1..t} e_(i_s) where 1 <= i_1 < i_2 < ... < i_t <= p + q and {i_1, i_2, ..., i_t} runs through all 2^(p+q) subsets of {1, 2, ..., p + q} (due to the failure of commutativity, one should be careful when taking continued products). Examples include: the real numbers Cl(0,0)(R), the complex numbers Cl(0,1)(R), split-complex numbers Cl(1,0)(R), quaternions Cl(1,0)(R), etc. If p + q = p' + q', then Cl(p,q)(R) is equal to Cl(p',q')(R) if and only if T(p,q) = T(p',q').
%C A323100 It can be shown that (Product_{s=1..t} e_(i_s))^2 = (-1)^(t*(t-1)/2)*(Product_{s=1..t} (e_(i_s))^2). So (Product_{s=1..t} e_(i_s))^2 = -1 if and only if t == 0, 1 (mod 4) and #({i_1, i_2, ..., i_t} intersect {p + 1, p + 2, ..., p + q}) is odd, or t == 2, 3 (mod 4) and #({i_1, i_2, ..., i_t} intersect {p + 1, p + 2, ..., p + q}) is even.
%C A323100 In general, let A = (a_ij) be any n X n symmetric {-1,1}-matrix, we can define an algebraic structure generated by {e_1, e_2, ..., e_n} where (e_i)^2 = a_ii for i = 1..n, (e_i)*(e_j) = (a_ij)*(e_j)*(e_i) for any i != j, ((e_i)*(e_j))*(e_k) = (e_i)*((e_j)*(e_k)) for any i, j, k. Clifford algebras are the cases where a_ij = -1 for any i != j. It can be shown that (Product_{s=1..t} e_(i_s)) * (Product_{s'=1..u} e_(j_s')) = (Product_{s=1..t, s'=1..u, i_s>=j_s'} a_(i_s)(j_s')) * (Product_{s=1..v} e_(k_s)), where 1 <= k_1 < k_2 < ... < k_v <= n and {k_1, k_2, ..., k_v} is the symmetric difference between {i_1, i_2, ..., i_t} and {j_1, j_2, ..., j_u}. Specially, (Product_{s=1..t} e_(i_s)))^2 = Product_{1<=s'<=s<=n} a_ss'. The 2^n basis, together with their additive inverses, form a group of order 2^(n+1) under multiplication, which is abelian if and only if a_ij = 1 for any i != j (in this case, it is isomorphic to (C_2)^(n+1) if a_ii = 1 for i = 1..n, and (C_2)^(n-1) X C_4 otherwise). The structure of this group can be complicated. For example, when n = 2, it can be isomorphic to either (C_2)^3, C_2 X C_4, C_2 X D_4 or Q_8.
%H A323100 Jianing Song, <a href="/A323100/b323100.txt">Antidiagonals n = 0..99, flattened</a>
%H A323100 Wikipedia, <a href="https://en.wikipedia.org/wiki/Hypercomplex_number#Clifford_algebras">Clifford algebras</a>
%F A323100 T(p,q) = Sum_{i=0..p} Sum_{j=0..q} binomial(p, i)*binomial(q, j)*(binomial(i - j, 2) mod 2).
%F A323100 T(p,q) = 2^(p+q) - A323346(p,q).
%e A323100 Table begins
%e A323100 p\q|  0   1   2    3    4    5  ...
%e A323100 ---+-------------------------------
%e A323100 0  |  0,  1,  3,   6,  10,  16, ...
%e A323100 1  |  0,  1,  4,  10,  20,  36, ...
%e A323100 2  |  1,  2,  6,  16,  36,  72, ...
%e A323100 3  |  4,  6, 12,  28,  64, 136, ...
%e A323100 4  | 10, 16, 28,  56, 120, 256, ...
%e A323100 5  | 20, 36, 64, 120, 240, 496, ...
%e A323100 ...
%e A323100 Example for T(1,3) = 10: (Start)
%e A323100 1^2 = 1;
%e A323100 (e_1)^2 = 1;
%e A323100 (e_2)^2 = -1;
%e A323100 (e_3)^2 = -1;
%e A323100 (e_4)^2 = -1;
%e A323100 ((e_1)*(e_2))^2 = -(e_1)^2*(e_2)^2 = 1;
%e A323100 ((e_1)*(e_3))^2 = -(e_1)^2*(e_3)^2 = 1;
%e A323100 ((e_1)*(e_4))^2 = -(e_1)^2*(e_4)^2 = 1;
%e A323100 ((e_2)*(e_3))^2 = -(e_2)^2*(e_3)^2 = -1;
%e A323100 ((e_2)*(e_4))^2 = -(e_2)^2*(e_4)^2 = -1;
%e A323100 ((e_3)*(e_4))^2 = -(e_3)^2*(e_4)^2 = -1;
%e A323100 ((e_1)*(e_2)*(e_3))^2 = -(e_1)^2*(e_2)^2*(e_3)^2 = -1;
%e A323100 ((e_1)*(e_2)*(e_4))^2 = -(e_1)^2*(e_2)^2*(e_4)^2 = -1;
%e A323100 ((e_1)*(e_3)*(e_4))^2 = -(e_1)^2*(e_3)^2*(e_4)^2 = -1;
%e A323100 ((e_2)*(e_3)*(e_4))^2 = -(e_2)^2*(e_3)^2*(e_4)^2 = 1;
%e A323100 ((e_1)*(e_2)*(e_3)*(e_4))^2 = (e_1)^2*(e_2)^2*(e_3)^2*(e_4)^2 = -1. (End)
%e A323100 From _Peter Luschny_, Jan 13 2019: (Start)
%e A323100 The first few lines of the triangle T(i-j,j) are:
%e A323100 [0]   0;
%e A323100 [1]   0,   1;
%e A323100 [2]   1,   1,   3;
%e A323100 [3]   4,   2,   4,   6;
%e A323100 [4]  10,   6,   6,  10,  10;
%e A323100 [5]  20,  16,  12,  16,  20,  16;
%e A323100 [6]  36,  36,  28,  28,  36,  36,  28;
%e A323100 [7]  64,  72,  64,  56,  64,  72,  64,  56;
%e A323100 [8] 120, 136, 136, 120, 120, 136, 136, 120, 120;
%e A323100 [9] 240, 256, 272, 256, 240, 256, 272, 256, 240, 256; (End)
%p A323100 s := sqrt(2): h := n -> [ 0, -s, -2, -s, 0, s, 2,  s][1 + modp(n+1, 8)]:
%p A323100 T := proc(n, k) option remember;
%p A323100 if n = 0 then return 2^(k - 1) + 2^((k - 3)/2)*h(k + 2) fi;
%p A323100 if k = 0 then return 2^(n - 1) + 2^((n - 3)/2)*h(n) fi;
%p A323100 T(n, k-1 ) + T(n-1, k) end:
%p A323100 for n from 0 to 9 do seq(T(n, k), k=0..9) od; # _Peter Luschny_, Jan 12 2019
%t A323100 T[n_, k_] := Sum[Binomial[n, i] Binomial[k, j] Mod[Binomial[i - j, 2], 2], {i, 0, n}, {j, 0, k}];
%t A323100 Table[T[n-k, k], {n, 0, 10}, {k, 0, n}] (* _Jean-François Alcover_, Jun 19 2019 *)
%o A323100 (PARI) T(p,q) = sum(i=0, p, sum(j=0, q, binomial(p, i)*binomial(q, j)*(binomial(i-j, 2)%2)))
%Y A323100 Cf. A038505(n+1) (first row), A000749(n+1) (first column), A006516 (main diagonal),
%Y A323100 A321959 (antidiagonal sums).
%Y A323100 A323346 is the complement sequence.
%K A323100 nonn,tabl
%O A323100 0,6
%A A323100 _Jianing Song_, Jan 04 2019