Corpus ID: 189762482

Smooth digraphs modulo primitive positive constructability

  title={Smooth digraphs modulo primitive positive constructability},
  author={M. Bodirsky and Florian Starke and A. Vucaj},
  journal={arXiv: Rings and Algebras},
We consider the poset that arises from ordering finite smooth digraphs 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 satisfies a prime cyclic loop condition that is not satisfied by the polymorphism clone of the other. 

Figures from this paper

Maximal Digraphs With Respect to Primitive Positive Constructibility
We study the class of all finite directed graphs (digraphs) up to primitive positive constructability. The resulting order has a unique greatest element, namely the digraph P1 with one vertex and noExpand


The wonderland of reflections
A new elegant dichotomy conjecture for the CSPs of reducts of finitely bounded homogeneous structures is formulated and a close connection between h1 clone homomorphisms and the notion of compatibility with projections used in the study of the lattice of interpretability types of varieties is revealed. Expand
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
It is shown that the CSP dichotomy for digraphs with no sources or sinks agrees with the algebraic characterization conjectured by Bulatov, Jeavons, and Krokhin in 2005. Expand
Loop conditions with strongly connected graphs
We prove that the existence of a term s satisfying s(r, a, r, e) = s(a, r, e, a) in a general algebraic structure is equivalent to an existence of a term t satisfying t(x, x, y, y, z, z) = t(y, z, z,Expand
A Proof of CSP Dichotomy Conjecture
  • Dmitriy Zhuk
  • Computer Science, Mathematics
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
An algorithm is presented that solves Constraint Satisfaction Problem in polynomial time for constraint languages having a weak near unanimity polymorphism, which proves the remaining part of the conjecture. Expand
Free Completely Distributive Lattices
We show that the usual construction of the free distributive lattice on n generators generalizes to an arbitrary quantity of generators and actually yields a free completely distributive lattice.Expand
Two-element structures modulo primitive positive constructability
Primitive positive constructions have been introduced in recent work of Barto, Opršal, and Pinsker to study the computational complexity of constraint satisfaction problems. Let $${\mathfrakExpand
A Dichotomy Theorem for Nonuniform CSPs
  • A. Bulatov
  • Mathematics, Computer Science
  • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP is either solvable in polynomial time or is NP-complete. Expand
Algebraic approach to promise constraint satisfaction
A new class of problems that can be viewed as algebraic versions of the (Gap) Label Cover problem are introduced, and it is shown that every PCSP with a fixed constraint language is equivalent to a problem of this form. Expand
Complexity Classification in Infinite-Domain Constraint Satisfaction
This thesis studies CSPs where the variables can take values from an infinite domain, and studies the limits of complexity classification, and presents classes of computational problems provably do not exhibit a complexity dichotomy into hard and easy problems. Expand