2019
DOI: 10.1142/s021819671950036x
|View full text |Cite
|
Sign up to set email alerts
|

Polynomial-time tests for difference terms in idempotent varieties

Abstract: We consider the following practical question: given a finite algebra [Formula: see text] in a finite language, can we efficiently decide whether the variety generated by [Formula: see text] has a difference term? We answer this question (positively) in the idempotent case and then describe algorithms for constructing difference term operations.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…condition of height 1 [Kaz21]. In [FV09] and [DFV19] it was shown that also some nonstrong Maltsev conditions can be decided in polynomial time, by studying local conditions (i.e. properties of subalgebras with bounded generating sets).…”
Section: Introductionmentioning
confidence: 99%
“…condition of height 1 [Kaz21]. In [FV09] and [DFV19] it was shown that also some nonstrong Maltsev conditions can be decided in polynomial time, by studying local conditions (i.e. properties of subalgebras with bounded generating sets).…”
Section: Introductionmentioning
confidence: 99%