Finitely related algebras in congruence modular varieties have few subpowers
type: Item
instance of: scholarly article
title: Finitely related algebras in congruence modular varieties have few subpowers
DOI: 10.4171/JEMS/790
author: Libor Barto
published in: Journal of the European Mathematical Society (JEMS)
publication date: 2018-06-21T00:00:00Z
review text: Summary: We show that every finite algebra which is finitely related and lies in a congruence modular variety has few subpowers. This result, combined with other theorems, has interesting consequences for the complexity of several computational problems associated to finite relational structures: the constraint satisfaction problem, the primitive positive formula comparison problem, and the learnability problem for primitive positive formulas. Another corollary is that it is decidable whether an algebra given by a set of relations has few subpowers.
Mathematics Subject Classification ID: 08B10
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 6892364
zbMATH Keywords: finitely related algebra
zbMATH Keywords: congruence modular variety
zbMATH Keywords: gumm terms
zbMATH Keywords: few subpowers
zbMATH Keywords: cube terms
MaRDI profile type: Publication
Wikidata QID: Q129942361
description: scientific article; zbMATH DE number 6892364