- Sperner families generator.
Code that can be used to generate Sperner families; a Sperner family over a set E being a set of subsets of E that are incomparable by inclusion. This code can generate all inequivalent Sperner families (up to permutations of E) for a set E of up to 7 elements. Equivalently, it can generate DNF or CNF formulas, hence it can be used to verify the OEIS sequence http://oeis.org/A003182. Available at https://gitlab.com/Gruyere/sperner-families-generator.
- Perfect matching of monotone Boolean functions with null Euler characteristic.
Code that can be used to test the conjecture presented in this paper. Up to now, no counter-example has been found. Available at https://gitlab.com/Gruyere/perfect-matching-of-monotone-boolean-functions-with-null-euler-characteristic.
- A game on directed acyclic graphs.
Code that can be used to test the conjecture presented in these slides. Up to now, no counter-example has been found. Available at https://gitlab.com/Gruyere/a-game-on-dags.