I added myself to the list again, with a similar collection of project suggestions to last year (transversal matroids, gammoids, graphic matroids got done by Zach Gershkoff).
--Stefan. On Friday, January 19, 2018 at 6:26:50 AM UTC-6, Dima Pasechnik wrote: > > Any traction to continue with this this year? > > On Thursday, January 19, 2017 at 7:56:49 PM UTC, Stefan van Zwam wrote: >> >> 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. >> > -- --- You received this message because you are subscribed to the Google Groups "sage-matroid" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
