Mastodawn

And to make this easily demonstrable, I implemented the algorithm in Haskell, albeit I haven't yet been able to test it enough to make sure it properly works for all cases (in particular, the single test case that's in the repo currently only tests SymmetricExchanges).
https://codeberg.org/fogti/nwc-decomb

#matroid #matroids

nwc-decomb

Neil White conjecture instance decombinator.

Codeberg.org

passagemath Nov 26

Just released: Version 10.6.38 of passagemath, the pip-installable modularized #SageMath fork, an #OpenSource general-purpose #Mathematics system in #Python. This version updates V. Shoup's #NTL to 10.6.0 and adds a package for oriented #matroids by M. Aichmayr. github.com/passagemath/...

Release passagemath-10.6.38 · ...

JMLR May 18, 2025

'Deletion Robust Non-Monotone Submodular Maximization over Matroids', by Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam.

http://jmlr.org/papers/v26/23-1219.html

#matroid #matroids #algorithms

Deletion Robust Non-Monotone Submodular Maximization over Matroids

xameer May 2, 2021

maximum matching in #bipartite graphs can be expressed as a problem of intersecting two partition #matroids. However, finding the largest set in an intersection of three or more matroids is NP-complete.