arXiv:2412.01107 [math.CO]AbstractReferencesReviewsResources
Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones
Published 2024-12-02Version 1
Extending Sparks's theorem, we determine the cardinality of the lattice of $(C_1,C_2)$-clonoids of Boolean functions for certain pairs $(C_1,C_2)$ of clones of essentially unary, linear, or $0$- or $1$-separating functions or semilattice operations. When such a $(C_1,C_2)$-clonoid lattice is uncountable, the proof is in most cases based on exhibiting a countably infinite family of functions with the property that distinct subsets thereof always generate distinct $(C_1,C_2)$-clonoids. In the cases when the lattice is finite, we enumerate the corresponding $(C_1,C_2)$-clonoids. We also provide a summary of the known results on cardinalities of $(C_1,C_2)$-clonoid lattices of Boolean functions.
Comments: 27 pages
Related articles: Most relevant | Search more
arXiv:2405.01164 [math.CO] (Published 2024-05-02)
Clonoids of Boolean functions with a monotone or discriminator source clone
arXiv:math/0601218 [math.CO] (Published 2006-01-10)
On a quasi-ordering on Boolean functions
arXiv:2305.13766 [math.CO] (Published 2023-05-23)
From multivalued to Boolean functions: preservation of soft nested canalization