Coloring complexes and combinatorial Hopf monoids

From MaRDI portal
Publication:2102693

DOI10.1016/J.JCTA.2022.105698zbMATH Open1502.05075arXiv1611.04079OpenAlexW3115875688MaRDI QIDQ2102693FDOQ2102693


Authors: Jacob A. White Edit this on Wikidata


Publication date: 29 November 2022

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the quasisymmetric function invariants associated to the combinatorial Hopf monoid. We show that the collection of all such coloring complexes forms a linearized combinatorial Hopf monoid, which is the terminal object in the category of combinatorial Hopf monoids with convex characters. We also study several examples of combinatorial Hopf monoids.


Full work available at URL: https://arxiv.org/abs/1611.04079




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Coloring complexes and combinatorial Hopf monoids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102693)