Hi all,
Another year, another opportunity to let a student work on some code for SageMath. I'm happy to volunteer as a mentor again, and would like some input on stuff we'd like to see for matroids and/or graphs. Examples:
* representability tests over various fields. Maybe use decompositions and stabilizer theorems to cut down on the number of matrices to check?
* A framework for dealing with minor-closed classes: like a set data structure, but with some support for minors.
* linear extensions/coextensions that keep track of allowed vectors.
* Proper support for graphic/cographic/frame matroids (showing the graph, resigning across cuts, Whitney switching, etc.)
* Tangles and branch decompositions.
* Gammoids
* Bracket rings/Tutte groups/universal partial fields.
Note that in the end, the student will write a proposal based on her/his taste, but typically the list we put up serves as a major source of inspiration.
What would you guys find to be a useful addition?
Best,
Stefan.