Smooth digraphs modulo primitive positive constructability and cyclic loop conditions
Rings and Algebras
2021-12-23 v5 Combinatorics
Abstract
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive lattice. Moreover, we show that in order to separate two smooth digraphs in our poset it suffices to show that the polymorphism clone of one of the digraphs satisfies a prime cyclic loop condition that is not satisfied by the polymorphism clone of the other. Furthermore, we prove that the poset of cyclic loop ordered by their strength for clones is a distributive lattice, too.
Cite
@article{arxiv.1906.05699,
title = {Smooth digraphs modulo primitive positive constructability and cyclic loop conditions},
author = {Manuel Bodirsky and Florian Starke and Albert Vucaj},
journal= {arXiv preprint arXiv:1906.05699},
year = {2021}
}