Abstract
Motivated by the Coxeter complex associated to a Coxeter system (W, S), we introduce a simplicial regular cell complex Δ(G, S) with a G-action associated to any pair (G, S) where G is a group and S is a finite set of generators for G which is minimal with respect to inclusion. We examine the topology of Δ(G, S), and in particular the representations of G on its homology groups. We look closely at the case of the symmetric group script G signn minimally generated by (not necessarily adjacent) transpositions, and their type-selected subcomplexes. These include not only the Coxeter complexes of type A, but also the well-studied chessboard complexes. © 2004 Discrete Mathematics and Theoretical Computer Science (DMTCS).
Author supplied keywords
Cite
CITATION STYLE
Babson, E., & Reiner, V. (2004). Coxeter-like complexes. Discrete Mathematics and Theoretical Computer Science, 6(2), 223–252. https://doi.org/10.46298/dmtcs.312
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.