On 2-generated minimal Taylor algebras of size 4
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.
math.LO↗
arXiv subjects
Publications and source records attributed to Petar Đapić.
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 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 the case of minimal Taylor algebras and in our setting, finding several simplifications compared to the more general case of smooth algebras Bulatov considered.