Deciding absorption
Rings and Algebras
2015-12-23 v1 Computational Complexity
Abstract
We characterize absorption in finite idempotent algebras by means of J\'onsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.
Cite
@article{arxiv.1512.07009,
title = {Deciding absorption},
author = {Libor Barto and Alexandr Kazda},
journal= {arXiv preprint arXiv:1512.07009},
year = {2015}
}