Petar Marković

We find a new definition of colored edge graphs of finite algebras in the case of minimal Taylor algebras, a definition which includes the graphs invented by A. Bulatov. Next we proceed to reprove the main results of A. Bulatov's theory in…

We prove that any 2-generated minimal Taylor algebra on a domain of size 4 is not simple. In addition, we find all such algebras up to isomorphism and term-equivalence.

We define a class of algebras, the semilattices of Mal'cev blocks (for short, SMB algebras). In a nutshell, these algebras are semilattices in which each element gets blown up into a Mal'cev algebra. We publish for the first time our old…

We begin the investigation of the variety of semilattices of Mal'cev blocks, which we call SMB algebras.

We prove that the constraint languages invariant under a short sequence of J\'onsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss…