arXiv · 1704.05928
Deciding some Maltsev conditions in finite idempotent algebras
Abstract
In this paper we investigate the computational complexity of deciding if a given finite algebraic structure satisfies a fixed (strong) Maltsev condition $Σ$. Our goal in this paper is to show that $Σ$-testing can be accomplished in polynomial time when the algebras tested are idempotent and the Maltsev condition $Σ$ can be described using paths. Examples of such path conditions are having a Maltsev term, having a majority operation, and having a chain of Jónsson (or Gumm) terms of fixed length.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Alexandr Kazda, Matt Valeriote. 2019-10-15. Deciding some Maltsev conditions in finite idempotent algebras. https://doi.org/10.1017/jsl.2019.73
Cite the original work for its findings. Save a collection to share your selection of sources.