We give three examples of large intervals in the lattice of (local) clones on an infinite set X, by exhibiting clones C_1, C_2, C_3 such that:
(1) the interval [C_1, O] in the lattice of local clones is (as a lattice) isomorphic to {0,1,2, ...} under the divisibility relation,
(2) the interval [C_2, O] in the lattice of local clones is isomorphic to the congruence lattice of an arbitrary semilattice,
(3) the interval [C_3, O] in the lattice of all clones is isomorphic to the lattice of all filters on X.
These examples explain the difficulty of obtaining a satisfactory analysis of the clone lattice on infinite sets.
In particular, (1) shows that the lattice of local clones is not dually atomic.
The following result has been shown recently in the form of a dichotomy: For every total clone $C$ on $\mathbf{2} := \{0,1\}$, the set $\mathcal{I}(C)$ of all partial clones on $\mathbf{2}$ whose total component is $C$, is either finite or of continuum cardinality. In this paper we show that the dichotomy holds, even if only strong partial clones are considered, i.e., partial clones which are closed under taking subfunctions: For every total clone $C$ on $\mathbf{2}$, the set $\mathcal{I}_{\mathrm{Str}}(C)$ of all strong partial clones on $\mathbf{2}$ whose total component is $C$, is either fi…
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 infinite ascending chains, or infinite descending chains, or infinite antichains. We give a connection between the lattice of these clones and semi-affine algebras. Furthermore, we show that the sublattice of idempotent clones of this lattice is finite and every idempotent monomial clone is principal.
We investigate the lattice I(n) of clones on the ring Z_n between the clone of polynomial functions and the clone of congruence preserving functions. The crucial case is when n is a prime power. For a prime p, the lattice I(p) is trivial and I(p^2) is known to be a 2-element lattice. We provide a description of I(p^3). To achieve this result, we prove a reduction theorem, which says that I(p^k) is isomorphic to a certain interval in the lattice of clones on Z_p^(k-1).
We show that for an infinite set X, if L is a completely distributive algebraic lattice with not more completely join irreducible elements than the size of the power set of X, then there is a monoidal interval in the clone lattice on X which is isomorphic to 1+L, which is L plus a new smallest element added. Concerning cardinalities of monoidal intervals this result implies that there exist monoidal intervals of all cardinalities of at most the size of the power set of X, as well as monoidal intervals of cardinality 2^k, for all cardinals k which are not greater than the power set of X.
The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any finite $n$-element lattice $L$ there is a set of at most $2n+2$ aggregation functions on $L$ from which the respective clone is generated. Namely, the set of generating aggregation functions consists only of at most $n$ unary functions, at most $n$ binary functions, and lattice operations $\wedge,\vee$, and all aggregation functions of $L$ are composed of them by…
The structure of the lattice of clones on a finite set has been proven to be very complex. To better understand the top of this lattice, it is important to provide a characterization of submaximal clones in the lattice of clones. It is known that the clones $Pol(θ)$ and $Pol(ρ)$ (where $θ$ is a nontrivial equivalence relation on $E_k = \{0,\dots, k-1\}$, and $ρ$ is among the six types of relations which characterize maximal clones) are maximal clones. In this paper, we provide a classification of relations (of Rosenberg's List) on $E_k$ such that the clone $Pol(θ) \cap Pol(ρ)$ is maximal in $P…
We investigate finitary functions from $\mathbb{Z}_{pq}$ to $\mathbb{Z}_{pq}$ for two distinct prime numbers $p$ and $q$. We show that the lattice of all clones on the set $\mathbb{Z}_{pq}$ which contain the addition of $\mathbb{Z}_{pq}$ is finite. We provide an upper bound for the cardinality of this lattice through an injective function to the direct product of the lattice of all $(\mathbb{Z}_p,\mathbb{Z}_q)$-linearly closed clonoids to the $p+1$ power and the lattice of all $(\mathbb{Z}_q,\mathbb{Z}_p)$-linearly closed clonoids to the $q+1$ power. These lattices are studied in arXiv:1910.11…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices, but that the class of lattices embeddable into the local clone lattice is strictly larger than that.
The clone lattice Cl(X) over an infinite set X is a complete algebraic lattice with 2^X compact elements. We show that every algebraic lattice with at most 2^X compact elements is a complete sublattice of Cl(X).
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices, but that the class of lattices embeddable into the local clone lattice is strictly larger than that: For example, the lattice $M_{2^ω}$ is a sublattice of the local clone lattice.
We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also characterize operations in the centralizer clone of a distributive lattice, and we prove that the essential arity of operations in the centralizer is bounded for every finite (possibly nondistributive) lattice. Using these results, we present a simple derivation for the centralizers of clones of Boolean functions.
We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone lattice. Moreover we find that, with one exception, even the cardinalities of the intervals between the monoid of all permutations and the maximal submonoids of the full transformation monoid are as large. Whether or not the only exception is of the same cardinality as the other intervals depends on additional axioms of set theory.
We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids above the permutations.
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 clone lattice. We summarize what we know about the clone lattice on an infinite base set X and formulate what we consider the most important open problems.
In a recent paper we proposed the study of aggregation functions on lattices via clone theory approach. Observing that aggregation functions on lattices just correspond to $0,1$-monotone clones, we have shown that all aggregation functions on a finite lattice $L$ can be obtained as usual composition of lattice operations $\wedge,\vee$, and certain unary and binary aggregation functions. The aim of this paper is to present a generating set for the class of intermediate (or, equivalently, idempotent) aggregation functions. This set consists of lattice operations and certain ternary idempotent ag…
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. For finite sets X the lattice is "dually atomic": every clone other than O is below a coatom of Cl(X). It was open whether Cl(X) is also dually atomic for infinite X. Assuming the continuum hypothesis, we show that there is a clone C on a countable set such that the interval of clones above C is linearly ordered, uncountable, and has no coatoms.
On an infinite base set X, every ideal of subsets of X can be associated with the clone of those operations on X which map small sets to small sets. We continue earlier investigations on the position of such clones in the clone lattice.
Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is not Borel. Moreover, we provide an example of a coatom in the clone lattice whose obvious definition via an ideal of subsets of natural numbers would suggest that it is complete coanalytic, but which turns out to be a rather simple Borel set.
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 such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the clone lattice. This is especially interesting if X is countably infinite, in which case it is known that such a description cannot be obtained for the second maximal clone over the unary functions.
Given an infinite set X and an ideal I of subsets of X, the set of all finitary operations on X which map all (powers of) I-small sets to I-small sets is a clone. In a 2001 article, G. Czedli and L. Heindorf asked whether or not for two particular ideals I and J on a countably infinite set X, the corresponding ideal clones were a covering in the lattice of clones. We give an affirmative answer to this question.
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 Cl(X) for infinite X. In the first chapter we prove the combinatorial result that if X is linearly ordered, then the median functions of different arity defined by that order all generate the same clone. The second chapter deals with clones containing the almost unary functions, that is, all functions whose value is determined by one of its variables up to a…
Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain ${\mathsf M}_3$-sublattices). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are $u_l, u_r \in [o, i] - \{o,i\}$ such that $o = u_l \wedge u_r$ and $i = u_l \vee u_r$, where $u_l$ is to the left of $u_r$. We prove that a rectangular interval of a rectangular lattice is a rectangular lattice. As an application, we get a recent result of G. Czédli.
IIn a finite lattice, a congruence spreads from a prime interval to another by a sequence of congruence-perspectivities through \emph{intervals of arbitrary size}, by a 1955 result of J. Jakubík. In this note, I introduce the concept of \emph{prime-perspectivity} and prove the Prime-projectivity Lemma: a congruence spreads from a prime interval to another by a sequence of prime-perspectivities through \emph{prime ntervals}. A planar semimodular lattice is \emph{slim} if it contains no $\mathsf{M}_3$ sublattice. I introduce the Swing Lemma, a very strong version of the Prime-projectivity Lemma …
A 1955 result of J.~Jakubí k states that for the prime intervals $\fp$ and $\fq$ of a finite lattice, $\con{\fp} \geq \con{\fq}$ if{}f $\fp$ is congruence-projective to~$\fq$ (\emph{via} intervals of arbitrary size). The problem is how to determine whether $\con{\fp} \geq \con{\fq}$ involving only prime intervals. Two recent papers approached this problem in different ways. G. Czédli's used trajectories for slim rectangular lattices---a special subclass of slim, planar, semimodular lattices. I used the concept of prime-projectivity for arbitrary finite lattices. In this note I show how my appr…
In an earlier paper, to describe how a congruence spreads from a prime interval to another in a finite lattice, I introduced the concept of prime-perspectivity and its transitive extension, prime-projectivity and proved the Prime-projectivity Lemma. In this paper, I specialize the Prime-projectivity Lemma to slim, planar, semimodular lattices to obtain the Swing Lemma, a very powerful description of the congruence generated by a prime interval in this special class of lattices.
Let $L$ be a slim, planar, semimodular lattice (slim means that it does not contain an ${\mathsf M}_3$-sublattice). We call the interval $I = [o, i]$ of $L$ \emph{rectangular}, if there are complementary $a, b \in I$ such that $a$ is to the left of $b$. We claim that a rectangular interval of a slim rectangular lattice is also a slim rectangular lattice. We will present some applications, including a recent result of G. Czédli. In a paper with E. Knapp about a dozen years ago, we introduced natural diagrams} for slim rectangular lattices. Five years later, G. Czédli introduced ${\E C}_1$-diagr…
We develop a purely ordinal model for aggregation functionals for lattice valued functions, comprising as special cases quantiles, the Ky Fan metric and the Sugeno integral. For modeling findings of psychological experiments like the reflection effect in decision behaviour under risk or uncertainty, we introduce reflection lattices. These are complete linear lattices endowed with an order reversing bijection like the reflection at 0 on the real interval $[-1,1]$. Mathematically we investigate the lattice of non-void intervals in a complete linear lattice, then the class of monotone interval-va…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $Σ$ = {x,y,z,...}, where each letter has a fixed number of occurrences. These lattices are known as multinomial lattices and, when card($Σ$) = 2, as lattices of lattice paths. By interpreting the letters x, y, z, . . . as axes, these words can be interpreted as discrete increasing paths on a grid of a d-dimensional cube, with d = card($Σ$).We show how to extend this ordering to images of continuous monotone func…
