Document Open Access Logo

Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation

Authors Benjamin Scheidt , Nicole Schweikardt

PDF

File

Thumbnail PDF
PDF
LIPIcs.MFCS.2023.79.pdf
  • Filesize: 0.92 MB
  • 15 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Finite Model Theory
  • Mathematics of computing → Hypergraphs
Keywords
  • counting logics
  • guarded logics
  • homomorphism counting
  • hypertree decompositions
  • hypergraphs
  • incidence graphs
  • quantum graphs

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We introduce the 2-sorted counting logic GC^k and its restriction RGC^k that express properties of hypergraphs. These logics have available k variables to address hyperedges, an unbounded number of variables to address vertices of a hypergraph, and atomic formulas E(e,v) to express that a vertex v is contained in a hyperedge e. We show that two hypergraphs H,H' satisfy the same sentences of the logic RGC^k if, and only if, they are homomorphism indistinguishable over the class of hypergraphs of generalised hypertree width at most k. Here, H,H' are called homomorphism indistinguishable over a class 𝒞 if for every hypergraph G ∈ 𝒞 the number of homomorphisms from G to H equals the number of homomorphisms from G to H'. This result can be viewed as a lifting (from graphs to hypergraphs) of a result by Dvořák (2010) stating that any two (undirected, simple, finite) graphs H,H' are indistinguishable by the k+1-variable counting logic C^{k+1} if, and only if, they are homomorphism indistinguishable over the class of graphs of tree-width at most k.

Cite As Get BibTex

Benjamin Scheidt and Nicole Schweikardt. Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation. In 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 272, pp. 79:1-79:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.MFCS.2023.79

Author Details

Benjamin Scheidt
  • Humboldt-Universität zu Berlin, Germany
Nicole Schweikardt
  • Humboldt-Universität zu Berlin, Germany

Funding

  • Schweikardt, Nicole: Partially supported by the ANR project EQUUS ANR-19-CE48- 0019; funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – project number 431183758 (gefördert durch die Deutsche Forschungsgemeinschaft (DFG) – Projektnummer 431183758).

Acknowledgements

We thank Isolde Adler for pointing us to the results in [Isolde Adler, 2006; Isolde Adler, 2004; Adler et al., 2007], which led to Theorem 2.3.

References

  1. Isolde Adler. Marshals, monotone marshals, and hypertree-width. J. Graph Theory, 47(4):275-296, 2004. URL: https://doi.org/10.1002/jgt.20025.
  2. Isolde Adler. Width Functions for Hypertree Decompositions. PhD thesis, Albert-Ludwigs Universität Freiburg, 2006. Available at URL: https://d-nb.info/979896851/34.
  3. Isolde Adler, Georg Gottlob, and Martin Grohe. Hypertree width and related hypergraph invariants. European Journal of Combinatorics, 28(8):2167-2181, 2007. URL: https://doi.org/10.1016/j.ejc.2007.04.013.
  4. Hajnal Andréka, István Németi, and Johan van Benthem. Modal languages and bounded fragments of predicate logic. J. Philos. Log., 27(3):217-274, 1998. URL: https://doi.org/10.1023/A:1004275029985.
  5. Jan Böker, Yijia Chen, Martin Grohe, and Gaurav Rattan. The complexity of homomorphism indistinguishability. In 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany, volume 138 of LIPIcs, pages 54:1-54:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.MFCS.2019.54.
  6. Jan Böker. Structural similarity and homomorphism counts. Master’s thesis, RWTH Aachen University, 2018. Google Scholar
  7. Jan Böker. Color Refinement, Homomorphisms, and Hypergraphs. In Ignas Sau and Dimitrios M. Thilikos, editors, Graph-Theoretic Concepts in Computer Science, volume 11789 of Lecture Notes in Computer Science, pages 338-350. Springer, Cham, 2019. Google Scholar
  8. Jin-Yi Cai, Martin Fürer, and Neil Immerman. An optimal lower bound on the number of variables for graph identification. Combinatorica, 12(4):389-410, December 1992. URL: https://doi.org/10.1007/BF01305232.
  9. Bruno Courcelle. Graph Grammars, Monadic Second-Order Logic And The Theory Of Graph Minors. In Neil Robertson and Paul Seymour, editors, Graph Structure Theory, volume 147 of Contemporary Mathematics, pages 565-590. AMS, 1993. Google Scholar
  10. Holger Dell, Martin Grohe, and Gaurav Rattan. Lovász meets Weisfeiler and Leman. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, volume 107 of LIPIcs, pages 40:1-40:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.40.
  11. Zdeněk Dvořák. On Recognizing Graphs by Numbers of Homomorphisms. Journal of Graph Theory, 64(4):330-342, 2010. Google Scholar
  12. Georg Gottlob, Gianluigi Greco, Nicola Leone, and Francesco Scarcello. Hypertree decompositions: Questions and answers. In Tova Milo and Wang-Chiew Tan, editors, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pages 57-74. ACM, 2016. Google Scholar
  13. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Hypertree Decompositions and Tractable Queries. Journal of Computer and System Sciences, 64(3):579-627, May 2002. Google Scholar
  14. Georg Gottlob, Nicola Leone, and Francesco Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences, 66(4):775-808, June 2003. Google Scholar
  15. Erich Grädel. On the restraining power of guards. J. Symb. Log., 64(4):1719-1742, 1999. URL: https://doi.org/10.2307/2586808.
  16. Martin Grohe. Counting Bounded Tree Depth Homomorphisms. In Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS'20, pages 507-520. ACM, July 2020. URL: https://doi.org/10.1145/3373718.3394739.
  17. Martin Grohe. Word2vec, Node2vec, Graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data. In Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS'20, pages 1-16. ACM, 2020. URL: https://doi.org/10.1145/3375395.3387641.
  18. Phokion G. Kolaitis and Moshe Y. Vardi. Conjunctive-Query Containment and Constraint Satisfaction. Journal of Computer and System Sciences, 61(2):302-332, October 2000. Google Scholar
  19. László Lovász. Operations with structures. Acta Mathematica Academiae Scientiarum Hungaricae, 18(3):321-328, 1967. Google Scholar
  20. László Lovász and Balázs Szegedy. Contractors and Connectors of Graph Algebras. Journal of Graph Theory, 60(1):11-30, 2008. Google Scholar
  21. Laura Mancinska and David E. Roberson. Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pages 661-672. IEEE, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00067.
  22. Benjamin Scheidt and Nicole Schweikardt. Counting homomorphisms from hypergraphs of bounded generalised hypertree width: A logical characterisation. CoRR, abs/2303.10980, 2023. URL: https://doi.org/10.48550/arXiv.2303.10980.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact