Parallel finding of minimal $ f\in \mathrm{cMaj}_6^{\{0,1\}} $ (py)

This dataset consists of a deterministic (mostly) parallel Python code, its documentation and its results. It accompanies the paper entitled “All minimal clones generated by $\{0,1\}$-valued majority operations on a six-element set”. Within the document, the set of all cyclic majority operations on \(A\) with values in \(\{0,1\}\) on injective triples is denoted by \(\mathrm{cMaj}_A^{\{0,1\}}\). The code is capable of identifying all \( f\in\mathrm{cMaj}_A^{\{0,1\}}\) that generate a minimal clone for \(|A|\in\{4,5,6\}\). The list of these functions is reduced up to an equivalence relation defined by conjugacy (isomorphisms). On \(A=\{0,1,2,3,4,5\}\) the set \(\mathrm{cMaj}_A^{\{0,1\}}\) contains \( 2^{40}= 1\,099\,511\,627\,776 \) functions, but only 258 non-equivalent minimal functions remain. More detailed information is available in the file parallel_finding_minimal_cs01mo_6.pdf (source code for this file is given in parallel_finding_minimal_cs01mo_6.tex).