On Maltsev Digraphs
We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize results from Kazda (2011) to show that a Maltsev digraph is preserved not only by a majority operation, but by a class of other operations (e.g., minority, Pixley) and obtain a O(|VG|4)-time algorithm to recognize Maltsev digraphs. We also prove analogous results for digraphs preserved by conservative Maltsev operations which we use to establish that the list homomorphism problem for Maltsev digraphs is in L. We then give a polynomial time characterisation of Maltsev digraphs admitting a conservative 2-semilattice operation. Finally, we give a simple inductive construction of directed acyclic digraphs preserved by a Maltsev operation, and relate them with series parallel digraphs.
Item Type | Article |
---|---|
Subjects | Mathematics(all) |
Date Deposited | 26 Jul 2024 12:46 |
Last Modified | 26 Jul 2024 12:46 |
Explore Further
Read more research from the creator(s):
Find work associated with the faculties and division(s):
- School of Physics, Astronomy and Mathematics
- Science & Technology Research Institute
- Centre for Computer Science and Informatics Research
Find other related resources:
- http://www.combinatorics.org/ojs/index.php/eljc/issue/view/Volume22-1 [error in script]