453 research outputs found

    Generalised dualities and maximal finite antichains in the homomorphism order of relational structures

    Get PDF
    The motivation for this paper is threefold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures. As opposed to the homomorphism order of undirected graphs (which has no non-trivial finite maximal antichains), the order of directed graphs has finite maximal antichains of any size. In this paper, we characterise explicitly all maximal antichains in the homomorphism order of directed graphs. Quite surprisingly, these maximal antichains correspond to generalised dualities. The notion of generalised duality is defined here in full generality as an extension of the notion of finitary duality, investigated in [J. Nešetřil, C. Tardif, Duality theorems for finite structures (characterising gaps and good characterisations), J. Combin. Theory Ser. B 80 (1) (2000) 80–97]. Building upon the results of the cited paper, we fully characterise the generalised dualities. It appears that these dualities are determined by forbidding homomorphisms from a finite set of forests (rather than trees). Finally, in the spirit of [A. Atserias, On digraph coloring problems and treewidth duality, in: Proceedings of the 21st IEEE Symposium on Logic in Computer Science, LICS’06, IEEE Computer Society, 2006; B. Larose, C. Loten, C. Tardif, A characterisation of first-order constraint satisfaction problems, in: Proceedings of the 21st IEEE Symposium on Logic in Computer Science, LICS’06, IEEE Computer Society, 2006; V. Dalmau, A. Krokhin, B. Larose, First-order definable retraction problems for posets and reflexive graphs, in: Proceedings of the 19th IEEE Symposium on Logic in Computer Science, LICS’04, IEEE Computer Society, 2004 [5]] we shall characterise “generalised” constraint satisfaction problems (defined also here) that are first-order definable. These are again just generalised dualities corresponding to finite maximal antichains in the homomorphism order

    On infinite-finite duality pairs of directed graphs

    Get PDF
    The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side 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 (which is the first one of a series) we start the detailed study of the infinite-finite case. Here we concentrate on directed graphs. We prove some elementary properties of the infinite-finite duality pairs, including lower and upper bounds on the size of D, and show that the elements of A must be equivalent to forests if A is an antichain. Then we construct instructive examples, where the elements of A are paths or trees. Note that the existence of infinite-finite antichain dualities was not previously known

    Dualities and dual pairs in Heyting algebras

    Get PDF
    We extract the abstract core of finite homomorphism dualities using the techniques of Heyting algebras and (combinatorial) categories.Comment: 17 pages; v2: minor correction

    Grothendieck Rings of Theories of Modules

    Full text link
    The model-theoretic Grothendieck ring of a first order structure, as defined by Krajic\v{e}k and Scanlon, captures some combinatorial properties of the definable subsets of finite powers of the structure. In this paper we compute the Grothendieck ring, K0(MR)K_0(M_\mathcal R), of a right RR-module MM, where R\mathcal R is any unital ring. As a corollary we prove a conjecture of Prest that K0(M)K_0(M) is non-trivial, whenever MM is non-zero. The main proof uses various techniques from the homology theory of simplicial complexes.Comment: 42 Page

    Homomorphisms and Structural Properties of Relational Systems

    Get PDF
    Two main topics are considered: The characterisation of finite homomorphism dualities for relational structures, and the splitting property of maximal antichains in the homomorphism order.Comment: PhD Thesis, 77 pages, 14 figure
    corecore