Polynomial-time tests for difference terms in idempotent varieties

DOI10.1142/S021819671950036XzbMath1468.08003arXiv2011.07879WikidataQ128295510 ScholiaQ128295510MaRDI QIDQ5237442

William Demeo, Ralph Freese, Matthew A. Valeriote

Publication date: 18 October 2019

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.07879

zbMATH Keywords

computational complexitytame congruence theoryidempotent algebradifference termMaltsev condition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Equational logic, Mal'tsev conditions (08B05) Structure theory of algebraic structures (08A05) Congruence modularity, congruence distributivity (08B10) Computational methods for problems pertaining to general algebraic systems (08-08)

Related Items

Characterizing the commutator in varieties with a difference term ⋮ Local–global property for G-invariant terms ⋮ Superassociative structures of terms and formulas defined by transformations preserving a partition

Cites Work

• Unnamed Item
• Unnamed Item
• Computing congruences efficiently
• Simpler Maltsev conditions for (weak) difference terms in locally finite varieties
• Varieties having Boolean factor congruences
• Varieties with a difference term
• A finite basis theorem for difference-term varieties with a finite residual bound
• COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• A Subalgebra Intersection Property for Congruence Distributive Varieties
• The structure of finite algebras
• Modularity prevents tails
• The Relationship Between Two Commutators
• The shape of congruence lattices
• Idempotent n -permutable varieties