Search arXivSearch

arXiv · 1611.01657

Cancelation free formula for the antipode of linearized Hopf monoid

Abstract

Many combinatorial Hopf algebras $H$ in the literature are the functorial image of a linearized Hopf monoid $\bf H$. That is, $H={\mathcal K} ({\bf H})$ or $H=\overline{\mathcal K} ({\bf H})$. Unlike the functor $\overline{\mathcal K}$, the functor ${\mathcal K}$ applied to ${\bf H}$ may not preserve the antipode of ${\bf H}$. In this case, one needs to consider the larger Hopf monoid ${\bf L}\times{\bf H}$ to get $H={\mathcal K} ({\bf H})=\overline{\mathcal K}({\bf L}\times{\bf H})$ and study the antipode in ${\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 ${\bf L}\times{\bf H}$. From this formula we obtain a new antipode formula for $H$. We also explore the case when ${\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 $\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 ${\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$. Finally, we sketch $q$ deformations and geometric interpretations of our results. This last part will appear in a sequel paper in joint work with J. Machacek.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nantel Bergeron, Carolina Benedetti. 2016-11-05. Cancelation free formula for the antipode of linearized Hopf monoid. https://arxiv.org/abs/1611.01657

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO