Papers
Topics
Authors
Recent
Search
2000 character limit reached

Clonoids of Boolean functions with essentially unary, linear, semilattice, or 0- or 1-separating source and target clones

Published 2 Dec 2024 in math.CO and math.RA | (2412.01107v1)

Abstract: 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.