-1. Add CartesianProductEJA.
+1. Add references and start citing them.
-2. Check the axioms in the constructor when check != False?
+2. Pre-cache charpoly for some more algebras.
-3. Add references and start citing them.
+3. Profile the construction of "large" matrix algebras (like the
+ 15-dimensional QuaternionHermitianAlgebra(3)) to find out why
+ they're so slow.
-4. Implement the octonion simple EJA.
+4. What the ever-loving fuck is this shit?
-5. Factor out the unit-norm basis (and operator symmetry) tests once
- all of the algebras pass.
+ sage: O = Octonions(QQ)
+ sage: e0 = O.monomial(0)
+ sage: e0*[[[[]]]]
+ [[[[]]]]*e0
-6. Refactor the current ungodly fast charpoly hack (relies on the
- theory to ensure that the charpolys are equal.)
+5. Every once in a long while, the test
-7. If we factor out a "matrix algebra" class, then it would make sense
- to replace the custom embedding/unembedding functions with static
- _real_embedding() and _real_unembedding() methods.
+ sage: set_random_seed()
+ sage: x = random_eja().random_element()
+ sage: x.is_invertible() == (x.det() != 0)
-8. Implement random_instance() for the main EJA class.
-
-9. Implement random_instance() for the subalgebra class.
+ in eja_element.py returns False.