Related papers: Clonoids between modules
Clonoids are sets of finitary operations between two algebraic structures that are closed under composition with their term operations on both sides. We conjecture that, for finite modules $\mathbf A$ and $\mathbf B$ there are only finitely…
A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…
We investigate the finitary functions from a finite product of finite fields $\prod_{j =1}^m\mathbb{F}_{q_j} = \mathbb{K}$ to a finite product of finite fields $\prod_{i =1}^n\mathbb{F}_{p_i} = \mathbb{F}$, where $|\mathbb{K}|$ and…
We investigate the finitary functions from a finite field $\mathbb{F}_q$ to the finite field $\mathbb{F}_p$, where $p$ and $q$ are powers of different primes. An $(\mathbb{F}_p,\mathbb{F}_q)$-linearly closed clonoid is a subset of these…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…
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…
Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…
We prove that for a finite first order structure $\mathbf{A}$ and a set of first order formulas $\Phi$ in its language with certain closure properties, the finitary relations on $A$ that are definable via formulas in $\Phi$ are uniquely…
The concept of a clone is central to many branches of mathematics, such as universal algebra, algebraic logic, and lambda calculus. Abstractly a clone is a category with two objects such that one is a countably infinite power of the other.…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…
A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…
A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…
We prove that every clone of operations on a finite set A, if it contains a Malcev operation, is finitely related -- i.e., identical with the clone of all operations respecting R for some finitary relation R over A. It follows that for a…
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 Boolean functions. Namely, when $C_1$ is a subclone (a proper subclone, resp.)…
A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations, we say that the clone is of finite degree. For each Minsky…
A genoid is a category of two objects such that one is the product of itself with the other. A genoid may be viewed as an abstract substitution algebra. It is a remarkable fact that such a simple concept can be applied to present a unified…
We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…
We investigate the lattice of clones that are generated by a set of functions that are induced on a finite field $\mathbb{F}$ by monomials. We study the atoms and coatoms of this lattice and investigate whether this lattice contains…