Complexes, Graphs, Homotopy, Products and Shannon Capacity
Oliver Knill

TL;DR
This paper explores the relationships between simplicial complexes and graphs through functors, homotopy, products, and Shannon capacity, revealing structural invariances and homotopy equivalences.
Contribution
It introduces invertible functors between complexes and graphs, establishes homotopy equivalences under Barycentric refinement, and links Shannon capacity to the structure of complexes.
Findings
phi(G) and psi(G) are invertible functors on complexes
Homotopy equivalences hold under Barycentric refinement
Shannon capacity equals the number of zero-dimensional sets in G
Abstract
A finite abstract simplicial complex G defines the Barycentric refinement graph phi(G) = (G,{ (a,b), a subset b or b subset a }) and the connection graph psi(G) = (G,{ (a,b), a intersected with b not empty }). We note here that both functors phi and psi from complexes to graphs are invertible on the image (Theorem 1) and that G,phi(G),psi(G) all have the same automorphism group and that the Cartesian product of G corresponding to the Stanley-Reisner product of phi(G) and the strong Shannon product of psi(G), have the product automorphism groups. Second, we see that if G is a Barycentric refinement, then phi(G) and psi(G) are graph homotopic (Theorem 2). Third, if gamma is the geometric realization functor, assigning to a complex or to a graph the geometric realization of its clique complex, then gamma(G) and gamma(phi(G)) and gamma(psi(G)) are all classically homotopic for a Barycentric…
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 · Homotopy and Cohomology in Algebraic Topology · Advanced Topology and Set Theory
