Existence of cube terms in finite algebras

DOI10.1007/s00012-020-00700-7zbMath1498.08006arXiv1901.04975OpenAlexW3120170916MaRDI QIDQ2226982

Dmitriy N. Zhuk, Alexandr Kazda

Publication date: 9 February 2021

Published in: Algebra Universalis (Search for Journal in Brave)

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

zbMATH Keywords

algorithmidempotent algebracube termnear unanimityfew subpowerscube term blocker

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40)

Related Items (2)

Finite degree clones are undecidable ⋮ Between an n-ary and an n + 1-ary near-unanimity term

Cites Work

• Unnamed Item
• Finitely related clones and algebras with cube terms.
• Key (critical) relations preserved by a weak near-unanimity function
• Cube term blockers without finiteness
• Near-unanimity is decomposable
• Dualizable algebras with parallelogram terms
• Closed systems of functions and predicates
• Deciding absorption
• COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS
• The existence of a near-unanimity term in a finite algebra is decidable
• Varieties with few subalgebras of powers
• ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS
• Tractability and Learnability Arising from Algebras with Few Subpowers

This page was built for publication: Existence of cube terms in finite algebras