2000 character limit reached
Combinatorial Hopf Algebras of Simplicial Complexes (1505.04458v2)
Published 17 May 2015 in math.CO
Abstract: We consider a Hopf algebra of simplicial complexes and provide a cancellation-free formula for its antipode. We then obtain a family of combinatorial Hopf algebras by defining a family of characters on this Hopf algebra. The characters of these combinatorial Hopf algebras give rise to symmetric functions that encode information about colorings of simplicial complexes and their $f$-vectors. We also use characters to give a generalization of Stanley's $(-1)$-color theorem. A $q$-analog version of this family of characters is also studied.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.