Deciding absorption in relational structures

DOI10.1007/s00012-017-0440-5zbMath1412.08004arXiv1601.06450OpenAlexW2964062224MaRDI QIDQ2407970

Jakub Bulín, Libor Barto

Publication date: 9 October 2017

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.06450

zbMATH Keywords

near unanimitycongruence distributivityfinitely related algebraabsorbing subalgebraJónsson absorbing subalgebra

Mathematics Subject Classification ID

Applications of universal algebra in computer science (08A70) Equational logic, Mal'tsev conditions (08B05) Structure theory of algebraic structures (08A05) Congruence modularity, congruence distributivity (08B10)

Related Items (1)

Not all nilpotent monoids are finitely related

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mal'tsev conditions, lack of absorption, and solvability.
• Finitely related algebras in congruence modular varieties have few subpowers
• The existence of a near-unanimity function is decidable
• Decidability of absorption in relational structures of bounded width.
• Closed systems of functions and predicates
• Deciding absorption
• Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Near Unanimity Constraints Have Bounded Pathwidth Duality
• Constraint Satisfaction Problems Solvable by Local Consistency Methods
• Congruence Distributivity Implies Bounded Width
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms

This page was built for publication: Deciding absorption in relational structures