X-Git-Url: http://gitweb.michael.orlitzky.com/?a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=f27df9cdc14c6e94cabd6a067285bc354ecd3cbe;hb=843814d06f42e6a97e31079173266fa6165e8c6a;hp=0d6edf2500664bbbad54e08b18f9e304765a7b6f;hpb=f904a86173b5f0dab18a409407e8ac708d9efb4b;p=sage.d.git

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 0d6edf2..f27df9c 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -2,7 +2,8 @@
 
 2. Add references and start citing them.
 
-3. Implement the octonion simple EJA.
+3. Implement the octonion simple EJA. We don't actually need octonions
+   for this to work, only their real embedding (some 8x8 monstrosity).
 
 4. Pre-cache charpoly for some small algebras?
 
@@ -15,8 +16,7 @@ sage: a0 = (1/4)*X[4]**2*X[6]**2 - (1/2)*X[2]*X[5]*X[6]**2 - (1/2)*X[3]*X[4]*X[6
    15-dimensional QuaternionHermitianAlgebra(3)) to find out why
    they're so slow.
 
-6. We should compute whether or not the algebra is associative if it
-   is unknown. I guess the "associative" argument should be ternary
-   (True, False, None)? We should also figure out the correct
-   True/False values for the example classes, and of course add an
-   _is_associative() method.
+6. Instead of storing a basis multiplication matrix, just make
+   product_on_basis() a cached method and manually cache its
+   entries. The cython cached method lookup should be faster than a
+   python-based matrix lookup anyway.