Hostname: page-component-586b7cd67f-rcrh6 Total loading time: 0 Render date: 2024-12-03T19:27:44.118Z Has data issue: false hasContentIssue false
  • English
  • Français

On Chromatic Functors and Stable Partitions of Graphs

Published online by Cambridge University Press:  20 November 2018

Ye Liu
Ye Liu*
Affiliation:
Department ofMathematics, Hokkaido University, North 10, West 8, Kita-ku, Sapporo, 060-0810, Japan e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

05C1520C30chromatic functorstable partitionrepresentation stability
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 60 , Issue 1 , 01 March 2017 , pp. 154 - 164
Copyright
Copyright © Canadian Mathematical Society 2017

References

[1] Church, T., Homological stability for configuration spaces of manifolds. Invent. Math. 188(2012), no. 2, 465–504. http://dx.doi.Org/10.1007/s00222-011-0353-4 Google Scholar
[2] Church, T., Ellenberg, J. S., and Farb, B., FI-modules and stability for representations of symmetric groups. Duke Math. J. 164(2015), no. 9, 1833–1910. http://dx.doi.Org/10.1215/00127094-3120274 Google Scholar
[3] Church, T. and Farb, B., Representation theory and homological stability. Adv. Math. 245(2013), 250–314. http://dx.doi.Org/10.1016/j.aim.2013.06.016 Google Scholar
[4] Farb, B., Representation stability. arxiv:1404.406.Google Scholar
[5] Jimenez-Rolland, R., Representation stability for the cohomology of the moduli space M”. Algebr. Geom. Topol. 11(2011), no. 5, 3011–3041. http://dx.doi.Org/10.21 4O/agt.2O11.11.3011 Google Scholar
[6] Read, R. C., An introduction to chromatic polynomials. J. Combinatorial Theory 4(1968), no. 1, 52–71. http://dx.doi.Org/10.1016/S0021-9800(68)80087-0 Google Scholar
[7] Stanley, R. P., Enumerative combinatorics. Vol. 2., Cambridge Studies in Advanced Mathematics, 62, Cambridge University Press, Cambridge, 1999. http://dx.doi.Org/10.1017/CBO9780511609589 Google Scholar
[8] Yoshinaga, M., Chromatic functors of graphs. arxiv:1507.06587Google Scholar