The homotopy type of the clique complex of the partition graph
Fedor B. Lyudogovskiy

TL;DR
This paper determines the homotopy type of the clique complex of a graph formed by partitions of an integer, showing it is a wedge of 2-spheres with a homotopy type fully characterized by its Euler characteristic.
Contribution
The authors classify all cliques in the graph of partitions and establish the homotopy equivalence of the clique complex to a wedge of 2-spheres, providing a complete topological description.
Findings
K_n is homotopy equivalent to a wedge of 2-spheres.
The number of spheres is given by the Euler characteristic minus one.
K_n is connected and simply connected, with homology concentrated in degree 2.
Abstract
For each positive integer , let be the graph whose vertices are the partitions of , with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let be the clique complex of . We prove that is homotopy equivalent to a wedge of -spheres. More precisely, is homotopy equivalent to a wedge of copies of , where . Thus the homotopy type of is completely determined by its Euler characteristic. The proof has three main ingredients. First, we classify all cliques in via two canonical families of simplices, called star-simplices and top-simplices, and use them to build a canonical cover of . Second, we pass to the corresponding nerve, construct a second natural cover, and show via the intersection poset of that cover that has the homotopy…
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 · Advanced Combinatorial Mathematics · Homotopy and Cohomology in Algebraic Topology
