Finite algebras with Hom-sets of polynomial size

DOI10.1090/tran/9262MaRDI QIDQ6653796

Libor Barto, Antoine Mottet

Publication date: 17 December 2024

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Structure theory of algebraic structures (08A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unary polynomials in algebras. I
• Classification theory and the number of non-isomorphic models.
• Finite algebras of finite complexity
• Dichotomies for classes of homomorphism problems involving unary functions
• On the structure of abstract algebras.
• Varieties with polynomially many models, I
• THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA
• Generative complexity in algebra
• The structure of locally finite varieties with polynomially many models
• Varieties with few subalgebras of powers
• The structure of finite algebras
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• An Easy Way to Minimal Algebras
• The shape of congruence lattices
• Algebras, Lattices, Varieties
• Algebras, Lattices, Varieties
• A Proof of the CSP Dichotomy Conjecture
• The complexity of the counting constraint satisfaction problem
• The complexity of satisfiability problems
• SOME INDECOMPOSABLE VARIETIES OF GROUPS
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras

This page was built for publication: Finite algebras with Hom-sets of polynomial size