We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We prove a representation stability result for the codimension-one cohomology of the level-three congruence subgroup of $\mathbf{SL}_{n}(\mathbb{Z})$. This is a special case of a question of Church, Farb, and Putman which we make more precise. Our methods involve proving finiteness properties of the Steinberg module for the group $\mathbf{SL}_{n}(K)$ for $K$ a field. This also lets us give a new proof of Ash, Putman, and Sam’s homological vanishing theorem for the Steinberg module. We also prove an integral refinement of Church and Putman’s homological vanishing theorem for the Steinberg module for the group $\mathbf{SL}_{n}(\mathbb{Z})$.
The chromatic functor of a simple graph is a functorization of the chromatic polynomial. M. Yoshinaga showed that two finitely graphs have isomorphic chromatic functors if and only if they have the same chromatic polynomial. The key ingredient in the proof is the use of stable partitions of graphs. The latter is shown to be closely related to chromatic functors. In this note, we further investigate some interesting properties of chromatic functors associated with simple graphs using stable partitions. Our first result is the determination of the group of natural automorphisms of the chromatic functor, which is, in general, a larger group than the automorphism group of the graph. The second result is that the composition of the chromatic functor associated with a finitely graph restricted to the category FI of finitely sets and injections with the free functor into the category of complex vector spaces yields a consistent sequence of representations of symmetric groups that is representation stable in the sense of Church–Farb.
The symmetric group ${{\mathcal{S}}_{n}}$ acts on the power set $\mathcal{P}\left( n \right)$ and also on the set of square free polynomials in $n$ variables. These two related representations are analyzed from the stability point of view. An application is given for the action of the symmetric group on the cohomology of the pure braid group.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.