ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS-Reference-Cited by-同舟云学术

ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS

Published:2009-02 Issue:01 Volume:19 Page:41-77
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

FREESE RALPH¹,VALERIOTE MATTHEW A.²

Affiliation:

1. Department of Mathematics, University of Hawaii, Honolulu, Hawaii, 96822, USA

2. Department of Mathematics & Statistics, McMaster University, Hamilton, Ontario, L8S 4K1, Canada

Abstract

This paper studies the complexity of determining if a finite algebra generates a variety that satisfies various Maltsev conditions, such as congruence distributivity or modularity. For idempotent algebras we show that there are polynomial time algorithms to test for these conditions but that in general these problems are EXPTIME complete. In addition, we provide sharp bounds in terms of the size of two-generated free algebras on the number of terms needed to witness various Maltsev conditions, such as congruence distributivity.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196709004956

Reference24 articles.

1. COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE

2. A Course in Universal Algebra

3. M. Clasen and M. Valeriote, Lectures on Algebraic Model Theory, Fields Institute Monographs 15 (American Mathematical Society, Providence RI, 2000) pp. 67–111.

4. A Characterization of Modularity for Congruence Lattices of Algebras*

5. A Characterization of Identities Implying Congruence Modularity I

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Relative lengths of Maltsev conditions;Algebra universalis;2024-05-24

2. Between an n-ary and an n + 1-ary near-unanimity term;International Journal of Algebra and Computation;2022-10-31

3. Local–global property for G-invariant terms;International Journal of Algebra and Computation;2022-06-21

4. Universal Algebraic Methods for Constraint Satisfaction Problems;Logical Methods in Computer Science;2022-01-19

5. Mitschke’s theorem is sharp;Algebra universalis;2022-01-12