[HTML][HTML] Commutator theory for loops
Abstract Using the Freese–McKenzie commutator theory for congruence modular varieties
as the starting point, we develop commutator theory for the variety of loops. The fundamental …
as the starting point, we develop commutator theory for the variety of loops. The fundamental …
[PDF][PDF] Maltsev families of varieties closed under join or Maltsev product
Maltsev families of varieties closed under join or Maltsev product Page 1 Algebra Universalis
Maltsev families of varieties closed under join or Maltsev product Ralph Freese and Ralph …
Maltsev families of varieties closed under join or Maltsev product Ralph Freese and Ralph …
Deciding some Maltsev conditions in finite idempotent algebras
A Kazda, M Valeriote - The Journal of Symbolic Logic, 2020 - cambridge.org
In this paper we investigate the computational complexity of deciding if the variety generated
by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be …
by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be …
Betweenness algebras
We introduce and study a class of betweenness algebras—Boolean algebras with binary
operators, closely related to ternary frames with a betweenness relation. From various …
operators, closely related to ternary frames with a betweenness relation. From various …
Commutative idempotent groupoids and the constraint satisfaction problem
A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie,
postulates that if a finite algebra A possesses a weak near-unanimity term, then the …
postulates that if a finite algebra A possesses a weak near-unanimity term, then the …
CREAM: a Package to Compute [Auto, Endo, Iso, Mono, Epi]-morphisms, Congruences, Divisors and More for Algebras of Type
The CREAM GAP package computes automorphisms, congruences, endomorphisms and
subalgebras of algebras with an arbitrary number of binary and unary operations; it also …
subalgebras of algebras with an arbitrary number of binary and unary operations; it also …
Polynomial-time tests for difference terms in idempotent varieties
We consider the following practical question: given a finite algebra A in a finite language,
can we efficiently decide whether the variety generated by A has a difference term? We …
can we efficiently decide whether the variety generated by A has a difference term? We …
Congruence lattices of finite algebras
WJ DeMeo - arxiv preprint arxiv:1204.4305, 2012 - arxiv.org
An important and long-standing open problem in universal algebra asks whether every finite
lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is …
lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is …
Preserving near unanimity terms under products
M Campanella, S Conley, M Valeriote - Algebra universalis, 2016 - Springer
Preserving near unanimity terms under products Page 1 Algebra Universalis Preserving near
unanimity terms under products Maria Campanella, Sean Conley, and Matt Valeriote This …
unanimity terms under products Maria Campanella, Sean Conley, and Matt Valeriote This …
Existence of cube terms in finite algebras
We study the problem of whether a given finite algebra with finitely many basic operations
contains a cube term; we give both structural and algorithmic results. We show that if such …
contains a cube term; we give both structural and algorithmic results. We show that if such …