Math 2.0

General algebraic systems Mal'cev conditions Concept

Taylor term

Summary

A Taylor term is an idempotent term with one identity in two variables x,yx, y for each argument place. The identity for a place has xx in that place on one side and yy in that place on the other side. Having a Taylor term is one of the weakest nontrivial Mal'cev conditions. For an idempotent variety, having a Taylor term means that no nontrivial algebra in the variety has only projections as term operations. It is central in the algebraic approach to constraint satisfaction. There, a finite core structure has a polynomial-time problem when its idempotent polymorphisms include a Taylor operation. Otherwise its problem is NP-complete.

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Constraint_satisfaction_problem
About this page
TagQEAMRNRJJD
URIm2://QEAMRNRJJD
Kindconcept
WritingW0 stub
MSC08B05, 08A70
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions

Special cases

Results about this