We will add certificates to various functions which give a boolean response, a feature to find the automorphisms of a matroid, and the ability to test if a given matroid is quaternary.
Currently the test to see if a matroid is graphic cannot return a graph in the case that the matroid is graphic. It also runs in exponential time. We plan on implementing an algorithm from Bixby and Wagner which will both be able to produce the graph and run in near linear time.
We will add a class for laminar matroids: This will serve as a warm up project, and could potentially be useful, as laminar matroids are important to some aspects of optimization.