Representation Stability for Configuration Spaces of Graphs

Abstract

We consider for two based graphs G and H the sequence of graphs Gk given by the wedge sum of G and k copies of H. These graphs have an action of the symmetric group k by permuting the H-summands. We show that the sequence of representations of the symmetric group Hq(Confn(G); Q), the homology of the ordered configuration space of these spaces, is representation stable in the sense of Church and Farb. In the case where G and H are trees, we provide a similar result for glueing along arbitrary subtrees instead of the base point. Furthermore, we show that stabilization alway holds for q = 1.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…