-1. Add CartesianProductEJA.
+1. Add references and start citing them.
-2. Add references and start citing them.
+2. Profile (and fix?) any remaining slow operations.
-3. Implement the octonion simple EJA.
+3. When we take a Cartesian product involving a trivial algebra, we
+ could easily cache the identity and charpoly coefficients using
+ the nontrivial factor. On the other hand, it's nice that we can
+ test out some alternate code paths...
-4. Override random_instance(), one(), et cetera in DirectSumEJA.
+4. Add dimension bounds on any tests over AA that compute element
+ subalgebras.
-5. Switch to QQ in *all* algebras for _charpoly_coefficients().
- This only works when we know that the basis can be rationalized...
- which is the case at least for the concrete EJAs we provide,
- but not in general.
-
-6. Pass already_echelonized (default: False) and echelon_basis
- (default: None) into the subalgebra constructor. The value of
- already_echelonized can be passed to V.span_of_basis() to save
- some time, and usinf e.g. FreeModule_submodule_with_basis_field
- we may somehow be able to pass the echelon basis straight in to
- save time.
-
- This may require supporting "basis" as a list of basis vectors
- (as opposed to superalgebra elements) in the subalgebra constructor.
-
-7. Use charpoly for inverse stuff if it's cached.
+5. The rational_algebra() stuff doesn't really belong in classes that
+ don't derive from RationalBasisEJA or its as-yet-nonexistent
+ element class.