Categories of models of languages
We exhibit a monoidal structure on the category of finite sets indexed by P-trees for a finitary polynomial endofunctor P. This structure categorifies the monoid scheme (over Spec ℕ) whose semiring of functions is (a P-version of) the Connes-Kreimer bialgebra H of rooted trees (a Hopf algebra after base change to ℤ and collapsing H 0). The monoidal structure is itself given by a polynomial functor, represented by three easily described set maps; we show that these maps are the same as those occurring...
We extend Rouquier’s categorification of the braid groups by complexes of Soergel bimodules to the virtual braid groups.
We develop a diagrammatic categorification of the polynomial ring ℤ[x]. Our categorification satisfies a version of Bernstein-Gelfand-Gelfand reciprocity property with the indecomposable projective modules corresponding to xⁿ and standard modules to (x-1)ⁿ in the Grothendieck ring.