Regular families of forests, antichains and duality pairs of relational structures

Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both sides are infinite seems to be very complex. It is also known that no finite-infinite duality pair is possible if we make the additional restriction that both classes are antichains. In this paper we characterize the infinite-finite antichain dualities and infinite-finite dualities with trees or forests on the left hand side. This work builds on our earlier papers [6] that gave several examples of infinite-finite antichain duality pairs of directed graphs and [7] giving a complete characterization for caterpillar dualities.

[1]  Jaroslav Nesetril,et al.  Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations) , 2000, J. Comb. Theory, Ser. B.

[2]  Claude Tardif,et al.  A Characterisation of First-Order Constraint Satisfaction Problems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[3]  Dwight Duffus,et al.  Antichains in the homomorphism order of graphs , 2007 .

[4]  Péter L. Erdös,et al.  How To Split Antichains In Infinite Posets* , 2007, Comb..

[5]  Andrei A. Krokhin,et al.  Caterpillar Duality for Constraint Satisfaction Problems , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[6]  Jaroslav Nesetril,et al.  Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality , 2005, SIAM J. Discret. Math..

[7]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[8]  Gábor Tardos,et al.  Caterpillar Dualities and Regular Languages , 2012, SIAM J. Discret. Math..

[9]  Jaroslav Nesetril,et al.  Generalised dualities and maximal finite antichains in the homomorphism order of relational structures , 2008, Eur. J. Comb..

[10]  Leonid Libkin,et al.  Logics for Unranked Trees: An Overview , 2005, Log. Methods Comput. Sci..

[11]  Péter L. Erdös,et al.  No Finite–Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs , 2010, Order.

[12]  Gábor Tardos,et al.  On Infinite–finite Duality Pairs of Directed Graphs , 2013, Order.

[13]  Andrei A. Bulatov,et al.  Dualities for Constraint Satisfaction Problems , 2008, Complexity of Constraints.