Weakly Idempotent Lattices and Bilattices, Non-Idempotent Plonka Functions

In this paper, we study weakly idempotent lattices with an additional interlaced operation. We characterize interlacity of a weakly idempotent semilattice operation, using the concept of hyperidentity and prove that a weakly idempotent bilattice with an interlaced operation is epimorphic to the superproduct with negation of two equal lattices. In the last part of the paper, we introduce the concepts of a non-idempotent Plonka function and the weakly Plonka sum and extend the main result for algebras with the well known Plonka function to the algebras with the non-idempotent Plonka function. As a consequence, we characterize the hyperidentities of the variety of weakly idempotent lattices, using non-idempotent Plonka functions, weakly Plonka sums and characterization of cardinality of the sets of operations of subdirectly irreducible algebras with hyperidentities of the variety of weakly idempotent lattices. Applications of weakly idempotent bilattices in multi-valued logic is to appear.

On Maltsev Digraphs

We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize results from Kazda (2011) to show that a Maltsev digraph is preserved not only by a majority operation, but by a class of other operations (e.g., minority, Pixley) and obtain a $O(|V_G|^4)$-time algorithm to recognize Maltsev digraphs. We also prove analogous results for digraphs preserved by conservative Maltsev operations which we use to establish that the list homomorphism problem for Maltsev digraphs is in L. We then give a polynomial time characterisation of Maltsev digraphs admitting a conservative 2-semilattice operation. Finally, we give a simple inductive construction of directed acyclic digraphs preserved by a Maltsev operation, and relate them with series parallel digraphs.

BOOLEAN FACTOR CONGRUENCES AND PROPERTY (*)

A variety [Formula: see text] has Boolean factor congruences (BFC) if the set of factor congruences of any algebra in [Formula: see text] is a distributive sublattice of its congruence lattice; this property holds in rings with unit and in every variety which has a semilattice operation. BFC has a prominent role in the study of uniqueness of direct product representations of algebras, since it is a strengthening of the refinement property. We provide an explicit Mal'cev condition for BFC. With the aid of this condition, it is shown that BFC is equivalent to a variant of the definability property (*), an open problem in Willard's work[9].