Skip to main content
SpringerLink
Log in

F3-Reconstruction and Bi-Founded 2-Structures

  • Published:
Order Aims and scope Submit manuscript

Abstract

Two binary relational structures of a same signature are (≤ k)-hypomorphic if they have the same vertex set and their restrictions to each set of at most k vertices are isomorphic. A binary relational structure is (≤ k)-reconstructible if it is isomorphic with each structure it is (≤ k)-hypomorphic with. We establish an inductive characterisation of pairs of (≤ 3)-hypomorphic binary relational structures (under some slight restriction). We infer a characterisation of (≤ 3)-reconstructibility for bi-founded binary relational structures. A binary relational structure is bi-founded if it has no infinite set of pairwise comparable strong modules. On the one hand, we describe operations generating exactly the class of (≤ 3)-reconstructible bi-founded binary relational structures from singleton ones. On the other hand, this characterisation can be formulated in terms of restrictions on the structuration of the tree of robust modules of the structure. This allows in particular the extension of Boudabbous and Lopez (Discrete Math. 291, 19–40, 3): a bi-founded tournament is(≤ 3)-reconstructibleif and only if all its modules are selfdual. Furthermore we show that the restrictions on structuration above do not characterise (≤ 3)-reconstructibility on any of the following two classes, of which the class of bi-founded structures is the intersection, namely the class of founded structures (the class of structures the collection of strong modules of which is well-founded for inclusion), and the class of co-founded structures (the class of structures the collection of strong modules of which is well-founded for the reverse of inclusion, equivalently every strong module of which is robust, corresponding to [15]’s class of completely decomposable structures). Indeed we provide examples of founded, resp. co-founded, non (≤ 3)-reconstructible tournaments every module of which is selfdual.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data Availability

Data sharing not applicable to this article as no datasets were generated or analysed during the current study.

References

  1. Boudabbous, Y.: La 5-reconstruction et l’indécomposabilité des relations binaires. Eur. J.Combin. 23, 507–522 (2002)

    Article  Google Scholar 

  2. Boudabbous, Y., Delhommé, C.: (≤ k)-reconstructible binary relations. Eur. J. Combin. 37, 43–67 (2014)

    Article  MathSciNet  Google Scholar 

  3. Boudabbous, Y., Lopez, G.: The minimal non (≤ k)-reconstructible relations. Discrete Math. 291, 19–40 (2005)

    Article  MathSciNet  Google Scholar 

  4. Boussaïri, A., Ille, P., Lopez, G., Thomassé, S.: The C3-structure of the tournaments. Discrete Math. 277, 29–43 (2004)

    Article  MathSciNet  Google Scholar 

  5. Courcelle, B., Delhommé, C.: The modular decomposition of countable graphs. Definition and construction in monadic second-order logic. Theor. Comp. Sc. 394(1-2), 1–38 (2008)

    Article  MathSciNet  Google Scholar 

  6. Cunningham, W.H.: Decomposition of directed graphs. SIAM J. Algebraic Discret. Methods 3(2), 214–228 (1982)

    Article  MathSciNet  Google Scholar 

  7. Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures. A Framework for Decomposition and Transformation of Graphs. World Scientific Publishing Co., River Edge, New-Jersey (1999)

    Book  Google Scholar 

  8. Fraïssé, R.: Abritement entre relations et spécialement entre chaînes. Symposi. Math. Inst. Nazionale di Alta Math. 5, 203–251 (1970)

    Google Scholar 

  9. Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25–66 (1967)

    Article  MathSciNet  Google Scholar 

  10. Hagendorf, J.-G.: Restriction respectueuse et reconstruction des chaînes et des relations infinies. Z. Math. Logik Grundlag. Math. 38, 457–490 (1992)

    Article  MathSciNet  Google Scholar 

  11. Hagendorf, J.-G., Lopez, G.: La demi-reconstructibilité des relations binaires d’au moins 13 éléments. C. R. Acad. Sci. Paris, Sér. I 317, 7–12 (1993)

    MathSciNet  Google Scholar 

  12. Hagendorf, J.-G., Lopez, G.: Un théorème de demi-reconstruction des relations binaires de cardinal supérieur à 12. Prépublications mathématiques d’Orsay 9268 (1993)

  13. Hagendorf, J.-G., Lopez, G., Rauzy, C.: Pavages d’une relation binaire. C. R. Acad. Sci. Paris, t 321 Sér. I, 1281–1286 (1995)

  14. Hagendorf, J.-G., Lopez, G., Rauzy, C.: Caractérisation des classes de (≤ 3)-hypomorphie à l’aide d’interdits. Proyecciones J. Math. 32(2), 91–105 (2013)

    Article  Google Scholar 

  15. Harju, T., Rozenberg, G.: Decomposition of infinite labeled 2-structures. Lec. Notes Comput. Sci. 812, 145–158 (1994)

    Article  MathSciNet  Google Scholar 

  16. Howard, P., Rubin, J.: Consequences of the Axiom of Choice. AMS Math. Surveys and Monographs 59 (1998)

  17. Kelly, D.: Comparabiliy graphs. In: Rival, I. (ed.) Graphs and Orders, pp 3–40. D. Reidel Publishing Company (1985)

  18. Lopez, G.: Deux résultats concernant la détermination d’une relation par les types d’isomorphie de ses restrictions. C. R. Acad. Sci. Paris Sér. A 274, 1525–1528 (1972)

    MathSciNet  Google Scholar 

  19. Lopez, G.: Sur la détermination d’une relation par les types d’isomorphie de ses restrictions. C. R. Acad. Sci. Paris Sér. A 275, 951–953 (1972)

    MathSciNet  Google Scholar 

  20. Lopez, G.: L’indéformabilité des relations et multirelations binaires. Z. Math. Logik Grundlag. Math. 24, 303–317 (1978)

    Article  Google Scholar 

  21. Lopez, G., Rauzy, C.: Reconstruction of binary relations from their restrictions of cardinality 2, 3, 4 and n − 1. I Z. Math. Log. Grundl. Math. 38, 27–37 (1992)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is dedicated to Maurice Pouzet on the occasion of his 75th birthday.

We are pleased to thank an anonymous referee for her/his careful reading of our manuscript as well as for her/his constructive suggestions.

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique et de Mathématiques (LIM), Université de La Réunion, Faculté des Sciences et Technologies, PTU, 2, rue Joseph Wetzel, 97490, Sainte-Clotilde, France

    Youssef Boudabbous & Christian Delhommé

Authors
  1. Youssef Boudabbous
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian Delhommé
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Delhommé.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Boudabbous, Y., Delhommé, C. F3-Reconstruction and Bi-Founded 2-Structures. Order 41, 135–182 (2024). https://doi.org/10.1007/s11083-022-09610-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-022-09610-w

Keywords

Mathematics Subject Classification (2010)

Search

Navigation