On some correspondences between relational structures and algebras
The aim of the paper is to show that if S(G) is distributive, and also G satisfies some additional condition, then the union of any two subgroupoids of G is also a subgroupoid (intuitively, G has to be in some sense a unary algebra).
In the present paper we generalize a few algebraic concepts to graphs. Applying this graph language we solve some problems on subalgebra lattices of unary partial algebras. In this paper three such problems are solved, other will be solved in papers [Pió I], [Pió II], [Pió III], [Pió IV]. More precisely, in the present paper first another proof of the following algebraic result from [Bar1] is given: for two unary partial algebras and , their weak subalgebra lattices are isomorphic if and only...
We introduce a way to color the regions of a classical knot diagram using ternary operations, so that the number of colorings is a knot invariant. By choosing appropriate substitutions in the algebras that we assign to diagrams, we obtain the relations from the knot group, and from the core group. Using the ternary operator approach, we generalize the Dehn presentation of the knot group to extra loops, and a similar presentation for the core group to the variety of Moufang loops.
There exists a natural extension of the notion of preorder from binary relations onto relations whose arities are arbitrary ordinals. In the article we find a condition under which extended preorders coincide with preorders if viewed categorically.
One of the main aims of the present and the next part [15] is to show that the theory of graphs (its language and results) can be very useful in algebraic investigations. We characterize, in terms of isomorphisms of some digraphs, all pairs , where is a finite unary algebra and a finite lattice such that the subalgebra lattice of is isomorphic to . Moreover, we find necessary and sufficient conditions for two arbitrary finite unary algebras to have isomorphic subalgebra lattices. We solve...
We use graph-algebraic results proved in [8] and some results of the graph theory to characterize all pairs of lattices for which there is a finite partial unary algebra such that its weak and strong subalgebra lattices are isomorphic to and , respectively. Next, we describe other pairs of subalgebra lattices (weak and relative, etc.) of a finite unary algebra. Finally, necessary and sufficient conditions are found for quadruples of lattices for which there is a finite unary algebra having...