Related papers: A forest formula for the antipode in incidence Hop…
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…
The permutation pattern Hopf algebra is a commutative filtered and connected Hopf algebra. Its product structure stems from counting patterns of a permutation, interpreting the coefficients as permutation quasi-shuffles. The Hopf algebra…
A set-operad is a monoid in the category of combinatorial species with respect to the operation of substitution. From a set-operad, we give here a simple construction of a Hopf algebra that we call {\em the natural Hopf algebra} of the…
We introduce a Hopf algebra structure of subword complexes, including both finite and infinite types. We present an explicit cancellation free formula for the antipode using acyclic orientations of certain graphs, and show that this Hopf…
In this paper, we give a cancellation-free antipode formula (for uniform matroids) for the restriction-contraction matroid Hopf algebra, using the technique of splitting and merging via a sign-reversing involution. The cancellation-free…
We give a new formula for the antipode of the algebra of rooted trees, directly in terms of the bialgebra structure. The equivalence, proved in this paper, among the three available formulae for the antipode, reflects the equivalence among…
The incidence algebra of a partially ordered set (poset) supports in a natural way also a coalgebra structure, so that it becomes a m-weak bialgebra even a m-weak Hopf algebra with M\"obius function as antipode. Here m-weak means that…
We adapt here the computation of characters on incidence Hopf algebras introduced by W. Schmitt in the 1990s to a family mixing bounded and unbounded posets. We then apply our results to the family of hypertree posets and partition posets.…
Three equivalent methods allow to compute the antipode of the Hopf algebras of Feynman diagrams in perturbative quantum field theory (QFT): the Dyson-Salam formula, the Bogoliubov formula, and the Zimmermann forest formula. Whereas the…
If H is a connected, graded Hopf algebra, then Takeuchi's formula can be used to compute its antipode. However, there is usually massive cancellation in the result. We show how sign-reversing involutions can sometimes be used to obtain…
In this paper, we give a cancellation-free antipode formula for the matroid-minor Hopf algebra. We then explore applications of this formula. For example, the cancellation-free formula expresses the antipode of uniform matroids as a sum…
We study the compatibility between the antipode and the preLie product of a Com-PreLie Hopf algebra, that is to say a commutative Hopf algebra with a complementary preLie product, compatible with the product and the coproduct in a certain…
Using set-theoretic considerations, we show that the forest formula for overlapping divergences comes from the Hopf algebra of rooted trees.
We obtain a cancellation-free formula, represented in terms of Schr\"oder trees, for the antipode in the double tensor Hopf algebra introduced by Ebrahimi-Fard and Patras. We apply the antipode formula in the context of non-commutative…
We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…
A \textit{grounded set family} on $I$ is a subset $F\subseteq2^I$ such that $\emptyset\in F$. We study a linearized Hopf monoid \textbf{SF} on grounded set families, with restriction and contraction inspired by the corresponding operations…
Recently the notion of post-Hopf algebra was introduced, with the universal enveloping algebra of a post-Lie algebra as the fundamental example. A novel property is that any cocommutative post-Hopf algebra gives rise to a sub-adjacent Hopf…
We introduce new partial order structures on the underlying sets of free nonsymmetric operads. These posets involve decorated ordered rooted trees, and their terminal intervals are lattices. These lattices are not graded, not self-dual, and…
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…
We introduce an infinitesimal Hopf algebra of planar trees, generalising the construction of the non-commutative Connes-Kreimer Hopf algebra. A non-degenerate pairing and a dual basis are defined, and a combinatorial interpretation of the…