# On finite Taylor algebras

@article{Wires2016OnFT, title={On finite Taylor algebras}, author={A. Wires}, journal={Int. J. Algebra Comput.}, year={2016}, volume={26}, pages={1547-1571} }

We establish a new hereditary characterization of finite idempotent Taylor algebras. This generalizes the algebraic constructions which figured in the recent successful characterization of the correctness of the bounded width algorithm for constraint satisfaction problems by finite idempotent algebras generating congruence meet-semidistributive varieties. We introduce the cyclic reduct of a finite Taylor algebra and prove a collapse of Mal’cev conditions.

#### Topics from this paper

#### References

SHOWING 1-10 OF 21 REFERENCES

Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem

- Mathematics, Computer Science
- Log. Methods Comput. Sci.
- 2012

Classifying the Complexity of Constraints Using Finite Algebras

- Mathematics, Computer Science
- SIAM J. Comput.
- 2005