Chessboard complex
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
A chessboard complex is a particular kind of abstract simplicial complex, which has various applications in topological graph theory and algebraic topology. Informally, the (m, n)-chessboard complex contains all sets of positions on an m-by-n chessboard, where rooks can be placed without attacking each other. Equivalently, it is the matching complex of the (m, n)-complete bipartite graph, or the independence complex of the m-by-n rook's graph.
A chessboard complex is a particular kind of abstract simplicial complex, which has various applications in topological graph theory and algebraic topology. Informally, the (m, n)-chessboard complex contains all sets of positions on an m-by-n chessboard, where rooks can be placed without attacking each other. Equivalently, it is the matching complex of the (m, n)-complete bipartite graph, or the independence complex of the m-by-n rook's graph.
Examples
In any (m,n)-chessboard complex, the neighborhood of each vertex has the structure of a (m − 1,n − 1)-chessboard complex. In terms of chess rooks, placing one rook on the board eliminates the remaining squares in the same row and column, leaving a smaller set of rows and columns where additional rooks can be placed. This allows the topological structure of a chessboard to be studied hierarchically, based on its lower-dimensional structures. An example of this occurs with the (4,5)-chessboard complex, and the (3,4)- and (2,3)-chessboard complexes within it: The (2,3)-chessboard complex is a hexagon, consisting of six vertices (the six squares of the chessboard) connected by six edges (pairs of non-attacking squares). The (3,4)-chessboard complex is a triangulation of a torus, with 24 triangles (triples of non-attacking squares), 36 edges, and 12 vertices. Six triangles meet at each vertex, in the same hexagonal pattern as the (2,3)-chessboard complex. The (4,5)-chessboard complex forms a three-dimensional pseudomanifold: in the neighborhood of each vertex, 24 tetrahedra meet, in the pattern of a torus, instead of the spherical pattern that would be required of a manifold. If the vertices are removed from this space, the result can be given a geometric structure as a cusped hyperbolic 3-manifold, topologically equivalent to the link complement of a 20-component link. The chessboard complex is (\nu_{m, n} - 1) -connected, where \nu_{m, n} := \min\{m, n, \lfloor\frac{m + n + 1}{3}\rfloor \} . The homology group H_{\nu_{m, n}}(M_{m, n}) is a 3-group of exponent at most 9, and is known to be exactly the cyclic group on 3 elements when m + n \equiv 1\pmod{3} . The (\lfloor\frac{n + m + 1}{3}\rfloor - 1) -skeleton of chessboard complex is vertex decomposable in the sense of Provan and Billera (and thus shellable), and the entire complex is vertex decomposable if n\geq 2m - 1 . As a corollary, any position of k rooks on a m-by-n chessboard, where k\leq\lfloor\frac{m + n + 1}{3}\rfloor , can be transformed into any other position using at most mn - k single-rook moves (where each intermediate position is also not rook-taking). The complex \Delta_{n_1,\ldots,n_k} is a "chessboard complex" defined for a k-dimensional chessboard. Equivalently, it is the set of matchings in a complete k-partite hypergraph. This complex is at least (\nu - 2) -connected, for \nu := \min\{n_1, \lfloor\frac{n_1 + n_2 + 1}{3}\rfloor, \dots, \lfloor\frac{n_1 + n_2 + \dots + n_k + 1}{2k + 1}\rfloor\}
Text derived from https://en.wikipedia.org/w/index.php?oldid=1297151974 under CC BY-SA 4.0; modifications have been made.