A specialized definition of colored edge graphs for minimal Taylor algebras enables simplified reproofs of Bulatov's key theorems.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Any 2-generated minimal Taylor algebra on a domain of size 4 is not simple, and all such algebras are classified up to isomorphism and term-equivalence.
citing papers explorer
-
The colored edge theory of A. Bulatov and binary absorption in minimal Taylor algebras
A specialized definition of colored edge graphs for minimal Taylor algebras enables simplified reproofs of Bulatov's key theorems.
-
On 2-generated minimal Taylor algebras of size 4
Any 2-generated minimal Taylor algebra on a domain of size 4 is not simple, and all such algebras are classified up to isomorphism and term-equivalence.