07/31/2018, 01:08 PM
Hi, everyone!
I have been writing a paper about Cayley-Dickson algebra and its higher 2^n-ion spaces. By xor extensions (from binary xoring to ternary, tetranary, pentanary,... etc.) we get 3^n-ions (Trions), 4^n-ions (Tetrions), ... . For this operation it is needed to check the existance of triads (or tetrads, pentads, hexads,... and so on to (b+1)-ads) of the (b^n)-ions. For instance the Bions (2^n-ions) exist, because there are plenty of triads, like (1;2;3). Trions are not exist, because there are no tetrads anywhere. Tetrions (4^n-ions) also exist, because there are pentads like (10;27;51). And (2^m)^n-ions exist, too.
How do I calculate it? I have extended complex bitwise (binary) operator xor to tritwise, tetratwise, pentatwise,... n-twise (n-ary) operator xor[n]. The n-ad is a set of numbers (x;y;z), iff: (x xor[n] y = z) and (z xor[n] x = y) and (y xor[n] z = x).
Let us suppose that a xor[n] b = (a+b) n-twise mod n.
Question 1: How to proof there is no Trions or the tetrads are empty?
Question 2: How to make a monochrome 2-D slice solution map for Tetrions? (In pari/gp if it is possible.) I would like to see the solution map of equation 10z xor[4] 27z = 51z. I know kneser.gp has a complex graphical solution, but not applied for slice map.
Thank you!
Xorter Unizo
I have been writing a paper about Cayley-Dickson algebra and its higher 2^n-ion spaces. By xor extensions (from binary xoring to ternary, tetranary, pentanary,... etc.) we get 3^n-ions (Trions), 4^n-ions (Tetrions), ... . For this operation it is needed to check the existance of triads (or tetrads, pentads, hexads,... and so on to (b+1)-ads) of the (b^n)-ions. For instance the Bions (2^n-ions) exist, because there are plenty of triads, like (1;2;3). Trions are not exist, because there are no tetrads anywhere. Tetrions (4^n-ions) also exist, because there are pentads like (10;27;51). And (2^m)^n-ions exist, too.
How do I calculate it? I have extended complex bitwise (binary) operator xor to tritwise, tetratwise, pentatwise,... n-twise (n-ary) operator xor[n]. The n-ad is a set of numbers (x;y;z), iff: (x xor[n] y = z) and (z xor[n] x = y) and (y xor[n] z = x).
Let us suppose that a xor[n] b = (a+b) n-twise mod n.
Question 1: How to proof there is no Trions or the tetrads are empty?
Question 2: How to make a monochrome 2-D slice solution map for Tetrions? (In pari/gp if it is possible.) I would like to see the solution map of equation 10z xor[4] 27z = 51z. I know kneser.gp has a complex graphical solution, but not applied for slice map.
Thank you!
Xorter Unizo
Xorter Unizo