2000 character limit reached
Polynomial-time Tests for Difference Terms in Idempotent Varieties (2011.07879v1)
Published 16 Nov 2020 in math.LO, cs.CC, and math.RA
Abstract: We consider the following practical question: given a finite algebra A in a finite language, can we efficiently decide whether the variety generated by A has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.