X-Git-Url: http://gitweb.michael.orlitzky.com/?p=sage.d.git;a=blobdiff_plain;f=mjo%2Feja%2FTODO;h=45a9ac06bf2c86020dee102143393e486fa408c5;hp=207c06d9156b38ac485f2de3a4d836089aa68d0b;hb=cf5e64b70869df65c7bb38888de54b1083e60d45;hpb=c96719c121e67d47e635f47a23ec0271cc149c77

diff --git a/mjo/eja/TODO b/mjo/eja/TODO
index 207c06d..45a9ac0 100644
--- a/mjo/eja/TODO
+++ b/mjo/eja/TODO
@@ -1,16 +1,22 @@
-A. Add tests for orthogonality in the Peirce decomposition.
+1. Add references and start citing them.
 
-1. Add CartesianProductEJA.
+2. Pre-cache charpoly for some more algebras.
 
-2. Check the axioms in the constructor when check != False?
+3. Profile the construction of "large" matrix algebras (like the
+   15-dimensional QuaternionHermitianAlgebra(3)) to find out why
+   they're so slow.
 
-3. Add references and start citing them.
+4. What the ever-loving fuck is this shit?
 
-4. Implement the octonion simple EJA.
+       sage: O = Octonions(QQ)
+       sage: e0 = O.monomial(0)
+       sage: e0*[[[[]]]]
+       [[[[]]]]*e0
 
-5. Factor out the unit-norm basis (and operator symmetry) tests once
-   all of the algebras pass.
+5. Every once in a long while, the test
 
-6. Can we make the minimal and characteristic polynomial tests work
-   for trivial algebras, too? Then we wouldn't need the "nontrivial"
-   argument to random_eja().
+       sage: set_random_seed()
+       sage: x = random_eja().random_element()
+       sage: x.is_invertible() == (x.det() != 0)
+
+   in eja_element.py returns False.