Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0806.2238

Two interacting Hopf algebras of trees

Damien Calaque·Kurusch Ebrahimi-Fard·Dominique Manchon
View original source ↗Read source document ↗Export metadata ↓

Abstract

Hopf algebra structures on rooted trees are by now a well-studied object, especially in the context of combinatorics. In this work we consider a Hopf algebra H by introducing a coproduct on a (commutative) algebra of rooted forests, considering each tree of the forest (which must contain at least one edge) as a Feynman-like graph without loops. The primitive part of the graded dual is endowed with a pre-Lie product defined in terms of insertion of a tree inside another. We establish a surprising link between the Hopf algebra H obtained this way and the well-known Connes-Kreimer Hopf algebra of rooted trees by means of a natural H-bicomodule structure on the latter. This enables us to recover recent results in the field of numerical methods for differential equations due to Chartier, Hairer and Vilmart as well as Murua.

Explore related subjects

math.COcs.NAmath.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Damien Calaque, Kurusch Ebrahimi-Fard, Dominique Manchon. 2011-12-17. Two interacting Hopf algebras of trees. https://doi.org/10.1016/j.aam.2009.08.003

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗