2000 character limit reached
Polynomial-time Tests for Difference Terms in Idempotent Varieties
Published 16 Nov 2020 in math.LO, cs.CC, and math.RA | (2011.07879v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.