Papers
Topics
Authors
Recent
Search
2000 character limit reached

Algebras from Congruences

Published 1 Oct 2019 in math.LO and math.CT | (1910.00689v2)

Abstract: We present a functorial construction which, starting from a congruence $\alpha$ of finite index in an algebra A, yields a new algebra C with the following properties: the congruence lattice of C is isomorphic to the interval of congruences between 0 and $\alpha$ on A, this isomorphism preserves higher commutators and TCT types, and C inherits all idempotent Maltsev conditions from A. As applications of this construction, we first show that supernilpotence is decidable for congruences of finite algebras in varieties that omit type 1. Secondly, we prove that the subpower membership problem for finite algebras with a cube term can be effectively reduced to membership questions in subdirect products of subdirectly irreducible algebras with central monoliths. As a consequence, we obtain a polynomial time algorithm for the subpower membership problem for finite algebras with a cube term in which the monolith of every subdirectly irreducible section has a supernilpotent centralizer.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.