Varieties with few subalgebras of powers
From MaRDI portal
Publication:3550542
DOI10.1090/S0002-9947-09-04874-0zbMath1190.08004OpenAlexW1978292808MaRDI QIDQ3550542
Ralph McKenzie, Ross Willard, Petar Marković, Paweł M. Idziak, Joel D. Berman, Matthew A. Valeriote
Publication date: 31 March 2010
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-09-04874-0
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Subalgebras, congruence relations (08A30)
Related Items (56)
Naturally dualizable algebras omitting types 1 and 5 have a cube term ⋮ CLAP: A New Algorithm for Promise CSPs ⋮ GROWTH OF GENERATING SETS FOR DIRECT POWERS OF CLASSICAL ALGEBRAIC STRUCTURES ⋮ Complexity and polymorphisms for digraph constraint problems under some basic constructions ⋮ GROWTH RATES OF ALGEBRAS, I: POINTED CUBE TERMS ⋮ Preserving near unanimity terms under products ⋮ A relational description of higher commutators in Mal'cev varieties ⋮ Constraint Satisfaction Problems Solvable by Local Consistency Methods ⋮ Independence of algebras with edge term ⋮ On Singleton Arc Consistency for CSPs Defined by Monotone Patterns ⋮ THE DISTRIBUTIVITY SPECTRUM OF BAKER’S VARIETY ⋮ Finite bands are finitely related ⋮ A strong Mal'cev condition for locally finite varieties omitting the unary type ⋮ On the complexity of \(\mathbb{H}\)-coloring for special oriented trees ⋮ Unnamed Item ⋮ Cube term blockers without finiteness ⋮ On finite Taylor algebras ⋮ Constraint satisfaction problem: what makes the problem easy ⋮ On the growth of generating sets for direct powers of semigroups. ⋮ Quantified Constraint Satisfaction and the Polynomially Generated Powers Property ⋮ Finitely related clones and algebras with cube terms. ⋮ Generic expression hardness results for primitive positive formula comparison ⋮ On finitely related semigroups. ⋮ An easy test for congruence modularity ⋮ Colouring, constraint satisfaction, and complexity ⋮ On the number of finite algebraic structures ⋮ Algebra and the Complexity of Digraph CSPs: a Survey ⋮ Existence of cube terms in finite algebras ⋮ Mal'tsev conditions, lack of absorption, and solvability. ⋮ On singleton arc consistency for CSPs defined by monotone patterns ⋮ Algebras from congruences ⋮ Maltsev families of varieties closed under join or Maltsev product ⋮ The matrix taxonomy of finitely complete categories ⋮ On the expression complexity of equivalence and isomorphism of primitive positive formulas ⋮ Quantified constraint satisfaction and the polynomially generated powers property ⋮ A compact representation for modular semilattices and its applications ⋮ THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA ⋮ Taylor's modularity conjecture and related problems for idempotent varieties ⋮ Optimal strong Mal'cev conditions for omitting type 1 in locally finite varieties. ⋮ COUNTING THE RELATIONS COMPATIBLE WITH AN ALGEBRA ⋮ Random models of idempotent linear Maltsev conditions. I. Idemprimality ⋮ Dualizable algebras with parallelogram terms ⋮ Congruence preserving expansions of nilpotent algebras ⋮ Mal'tsev condition satisfaction problems for conditions which imply edge terms ⋮ Unnamed Item ⋮ Deciding absorption ⋮ Mitschke's theorem is sharp ⋮ The number of clones determined by disjunctions of unary relations ⋮ Unnamed Item ⋮ Recent Results on the Algebraic Approach to the CSP ⋮ COMPUTATIONAL COMPLEXITY OF VARIOUS MAL'CEV CONDITIONS ⋮ Growth rates of algebras, II: Wiegold dichotomy ⋮ Unnamed Item ⋮ Between an n-ary and an n + 1-ary near-unanimity term ⋮ Testing for edge terms is decidable ⋮ Finitely generated equational classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The expressive rate of constraints
- Polynomial interpolation and the Chinese remainder theorem for algebraic systems
- On the algebraic structure of combinatorial problems
- Learnability of quantified formulas.
- Learning intersection-closed classes with signatures
- Few subpowers, congruence distributivity and near-unanimity terms
- Near-unanimity is decomposable
- Dualizable algebras with parallelogram terms
- Generative complexity in algebra
- The structure of locally finite varieties with polynomially many models
- Geometrical methods in congruence modular algebras
- The structure of finite algebras
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Vaught's Conjecture for Varieties
- Classifying the Complexity of Constraints Using Finite Algebras
- Tractability and Learnability Arising from Algebras with Few Subpowers
- A Simple Algorithm for Mal'tsev Constraints
- Categoricity in Power
- A Characterization of Modularity for Congruence Lattices of Algebras*
This page was built for publication: Varieties with few subalgebras of powers
