pith. sign in

arxiv: math/0512227 · v2 · submitted 2005-12-11 · 🧮 math.CO · math.RA

Trees, set compositions and the twisted descent algebra

classification 🧮 math.CO math.RA
keywords treesalgebracompositionsenvelopingincreasingtwisteddescentlinear
0
0 comments X
read the original abstract

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the linear span of set compositions (the twisted descent algebra). Among others, a number of enveloping algebra structures are introduced and studied in detail. For example, it is shown that the linear span of trees carries an enveloping algebra structure and embeds as such in an enveloping algebra of increasing trees. All our constructions arise naturally from the general theory of twisted Hopf algebras.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.