Morphism complexes of sets with relations
Takahiro Matsushita

TL;DR
This paper studies the homotopy theory of $r$-sets, generalizing graph Hom complexes to hypergraphs, introducing singular complexes, and establishing their homotopy equivalence and folding theorems.
Contribution
It introduces singular complexes for $r$-sets, proves their homotopy equivalence with Hom complexes, and generalizes $ imes$-homotopy theory to hypergraphs with a folding theorem.
Findings
Singular complexes are homotopy equivalent to Hom complexes.
Established a folding theorem for hypergraphs.
Generalized $ imes$-homotopy theory to $r$-sets.
Abstract
Let be a positive integer. An -set is a pair consisting of a set with a subset of the direct product . The object of this paper is to investigate the Hom complexes of -sets, which were introduced for graphs in the context of the graph coloring problem. In the first part, we introduce simplicial sets which we call singular complexes, and show that singular complexes and Hom complexes are naturally homotopy equivalent. The second part is devoted to the generalization of -homotopy theory established by Dochtermann. We show the folding theorem for hypergraphs which was partly proved by Iriye and Kishimoto.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis
