2022/04/12 by Anurag Singh, Singh, Anurag
Computer Science · #05E45 #55P10 #Algebraic Topology (math.AT) #Combinatorics (math.CO) #Data Management and Algorithms #FOS: Mathematics #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.2204.05629
openalex publication_date 2022/04/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The independence complex of a graph G is a simplicial complex whose simplices are the independent sets in G. In the last couple of decades, the independence complexes of square grids (with various boundary conditions) have gained much attention because of their connections with the hard square model from statistical physics. In this article, we prove that if G is an m× n grid with open or cylindrical boundary condition then its independence complex is homotopy equivalent to a wedge of spheres. A part of this result settles a conjecture of Iriye.