相关论文: Trees, set compositions and the twisted descent al…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of binary trees whose leaves are labeled by letters of an alphabet…

We equip the graded polynomial algebra generated by nonplanar rooted binary trees with a Hopf algebra structure by defining a coproduct which disallows cutting both children of any given vertex, refining Connes-Kreimer's notion 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…

Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

We construct a Hopf algebra on integer binary relations that contains under the same roof several well-known Hopf algebras related to the permutahedra and the associahedra: the Malvenuto-Reutenauer algebra on permutations, the Loday-Ronco…

By means of a new notion of subforests of an angularly decorated rooted forest, we give a combinatorial construction of a coproduct on the free Rota-Baxter algebra on angularly decorated rooted forests. We show that this coproduct equips…

We present a new framework for compositional distributional semantics in which the distributional contexts of lexemes are expressed in terms of anchored packed dependency trees. We show that these structures have the potential to capture…

We propose a novel approach for studying rooted trees by using functions that we will call descent functions. We provide a construction method for rooted trees that allows to study their properties through the use of descent functions.…

We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…

This paper generalizes the operadic construction of the Connes-Kreimer Hopf algebra of rooted trees by Moerdijk. Examples of Hopf algebras obtained in this way include the Loday-Ronco Hopf algebra of planar binary trees and the…

We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…

Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective correspondence between signed permutations and leveled…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We investigate a class of combinatory algebras, called ribbon combinatory algebras, in which we can interpret both the braided untyped linear lambda calculus and framed oriented tangles. Any reflexive object in a ribbon category gives rise…

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…

Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…

The notion of inner linear Hopf algebra is a generalization of the notion of discrete linear group. In this paper, we prove two general results that enable us to enlarge the class of Hopf algebras that are known to be inner linear: the…

In a recent article we introduced a mechanism for producing a presentation of the descent algebra of the symmetric group as a quiver with relations, the mechanism arising from a new construction of the descent algebra as a homomorphic image…

It is known that the vector space spanned by labeled rooted trees forms a Hopf algebra. Let k be a field and let R be a commutative k-algebra. Let H denote the Hopf algebra of rooted trees labeled using derivations D in Der(R). In this…