Introduction to coalgebra.
Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...
According to S. Krstić, there are only four quadratic varieties which are closed under isotopy. We give a simple procedure generating quadratic identities and deciding which of the four varieties they define. There are about 37000 such identities with up to five variables.
To every subset of a complete lattice we assign subsets , and define join-closed and meet-closed sets in . Some properties of such sets are proved. Join- and meet-closed sets in power-set lattices are characterized. The connections about join-independent (meet-independent) and join-closed (meet-closed) subsets are also presented in this paper.
Let τ be a type of algebras. A common measurement of the complexity of terms of type τ is the depth of a term. For k ≥ 1, an identity s ≈ t of type τ is said to be k-normal (with respect to this depth complexity measurement) if either s = t or both s and t have depth ≥ k. A variety is called k-normal if all its identities are k-normal. Taking k = 1 with respect to the usual depth valuation of terms gives the well-known property of normality of identities or varieties. For any variety V, there is...