-0. 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. The EJA random element method only returns two summands by default.
\ No newline at end of file
+ sage: set_random_seed()
+ sage: x = random_eja().random_element()
+ sage: x.is_invertible() == (x.det() != 0)
+
+ in eja_element.py returns False.