
We characterize absorption in finite idempotent algebras by means of Jónsson 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.
FOS: Computer and information sciences, Computer Science - Computational Complexity, Rings and Algebras (math.RA), FOS: Mathematics, Mathematics - Rings and Algebras, 08A70, 08B10, Computational Complexity (cs.CC)
FOS: Computer and information sciences, Computer Science - Computational Complexity, Rings and Algebras (math.RA), FOS: Mathematics, Mathematics - Rings and Algebras, 08A70, 08B10, Computational Complexity (cs.CC)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
