Cancelation free formula for the antipode of linearized Hopf monoid

preprint2016arXivOpen access

Abstract

Many combinatorial Hopf algebras HH in the literature are the functorial image of a linearized Hopf monoid H\bf H. That is, H=K(H)H={\mathcal K} ({\bf H}) or H=K‾(H)H=\overline{\mathcal K} ({\bf H}). Unlike the functor K‾\overline{\mathcal K}, the functor K{\mathcal K} applied to H{\bf H} may not preserve the antipode of H{\bf H}. In this case, one needs to consider the larger Hopf monoid L×H{\bf L}\times{\bf H} to get H=K(H)=K‾(L×H)H={\mathcal K} ({\bf H})=\overline{\mathcal K}({\bf L}\times{\bf H}) and study the antipode in L×H{\bf L}\times{\bf H}. One of the main results in this paper provides a cancelation free and multiplicity free formula for the antipode of L×H{\bf L}\times{\bf H}. From this formula we obtain a new antipode formula for HH. We also explore the case when H{\bf H} is commutative and cocommutative. In this situation we get new antipode formulas that despite of not being cancelation free, can be used to obtain one for K‾(H)\overline{\mathcal K}({\bf H}) in some cases. We recover as well many of the well-known cancelation free formulas in the literature. One of our formulas for computing the antipode in H{\bf H} involves acyclic orientations of hypergraphs as the central tool. In this vein, we obtain polynomials analogous to the chromatic polynomial of a graph, and also identities parallel to Stanley's (-1)-color theorem. One of our examples introduces a {\it chromatic} polynomial for permutations which counts increasing sequences of the permutation satisfying a pattern. We also study the statistic obtained after evaluating such polynomial at −1-1. Finally, we sketch qq deformations and geometric interpretations of our results. This last part will appear in a sequel paper in joint work with J. Machacek.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.