Varieties with few subalgebras of powers
Open Access
- 19 October 2009
- journal article
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 362 (3) , 1445-1473
Abstract
The Constraint Satisfaction Problem Dichotomy Conjecture of Feder and Vardi (1999) has in the last 10 years been profitably reformulated as a conjecture about the set S P fin ( A ) \sf {SP}_\textsf {fin}(\mathbf {A}) of subalgebras of finite Cartesian powers of a finite universal algebra A \mathbf {A} . One particular strategy, advanced by Dalmau in his doctoral thesis (2000), has confirmed the conjecture for a certain class of finite algebras A \mathbf {A} which, among other things, have the property that the number of subalgebras of A n \mathbf {A}^n is bounded by an exponential polynomial. In this paper we characterize the finite algebras A \mathbf {A} with this property, which we call having few subpowers , and develop a representation theory for the subpowers of algebras having few subpowers. Our characterization shows that algebras having few subpowers are the finite members of a newly discovered and surprisingly robust Maltsev class defined by the existence of a special term we call an edge term . We also prove some tight connections between the asymptotic behavior of the number of subalgebras of A n \mathbf {A}^n and some related functions on the one hand, and some standard algebraic properties of A \mathbf {A} on the other hand. The theory developed here was applied to the Constraint Satisfaction Problem Dichotomy Conjecture, completing Dalmau’s strategy.Keywords
This publication has 21 references indexed in Scilit:
- Learning intersection-closed classes with signaturesTheoretical Computer Science, 2007
- A Simple Algorithm for Mal'tsev ConstraintsSIAM Journal on Computing, 2006
- The expressive rate of constraintsAnnals of Mathematics and Artificial Intelligence, 2005
- Generative complexity in algebraMemoirs of the American Mathematical Society, 2005
- Classifying the Complexity of Constraints Using Finite AlgebrasSIAM Journal on Computing, 2005
- Learnability of quantified formulasTheoretical Computer Science, 2003
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group TheorySIAM Journal on Computing, 1998
- A Course in Universal Algebra1981
- Polynomial interpolation and the Chinese Remainder Theorem for algebraic systemsMathematische Zeitschrift, 1975
- A Characterization of Modularity for Congruence Lattices of Algebras*Canadian Mathematical Bulletin, 1969