1. CMB Online first
 Criswell, Jackson; Salisbury, Ben; Tingley, Peter W.

PBW bases and marginally large tableaux in types B and C
We explicitly describe the isomorphism between two combinatorial
realizations of Kashiwara's infinity crystal in types B and C.
The first realization is in terms of marginally large tableaux
and the other is in terms of Kostant partitions coming from PBW
bases. We also discuss a stack notation for Kostant partitions
which simplifies that realization.
Keywords:crystal, Kostant partition, Lusztig data, marginally large tableau Categories:05E10, 17B37 

2. CMB 2016 (vol 60 pp. 154)
 Liu, Ye

On Chromatic Functors and Stable Partitions of Graphs
The chromatic functor of a simple graph is a functorization of
the chromatic polynomial. M. Yoshinaga showed
that two finite 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 to 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 to a finite graph restricted to the category $\mathrm{FI}$
of finite sets and injections with the free functor into the
category of complex vector spaces yields a consistent sequence
of representations of symmetric groups which is representation
stable in the sense of ChurchFarb.
Keywords:chromatic functor, stable partition, representation stability Categories:05C15, 20C30 

3. CMB 2009 (vol 52 pp. 127)