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

We consider evolution algebras and their related substructures: evolution ideals and evolution subalgebras. After exposing some of the concepts related to them in the literature, we explore the order structures that arise in the sets of…

We generalize the concept of ascending and descending runs from permutations to rooted labelled trees and mappings, i.e., functions from the set $\{1, \dots, n\}$ into itself. A combinatorial decomposition of the corresponding functional…

Starting from a very general trace-form entropy, we introduce a pair of algebraic structures endowed by a generalized sum and a generalized product. These algebras form, respectively, two Abelian fields in the realm of the complex numbers…

We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…

We construct an universal enveloping algebra associated to the ternary extension of Lie (super)algebras called Lie algebra of order three. A Poincar\'e-Birkhoff-Witt theorem is proven is this context. It this then shown that this universal…

Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.

A Bialgebra is a module over a ring that is both an associative algebra and a co-associative coalgebra with the product and coproduct additionally satisfying an appropriate commutative relationship. One application of Bialgebras is in the…

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…

In a first part, we formalize the construction of combinatorial Hopf algebras from plactic-like monoids using polynomial realizations. Thank to this construction we reveal a lattice structure on those combinatorial Hopf algebras. As an…

We construct and study new generalisations to rooted trees and forests of some properties of shuffles of words. First, we build a coproduct on rooted trees which, together with their shuffle, endow them with bialgebra structure. We then…

Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…

In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…

Using the theory of noncommutative symmetric functions, we introduce the higher order peak algebras, a sequence of graded Hopf algebras which contain the descent algebra and the usual peak algebra as initial cases (N = 1 and N = 2). We…

We introduce the notions of preordered and heap-preordered forests, generalizing the construction of ordered and heap-ordered forests. We prove that the algebras of preordered and heap-preordered forests are Hopf for the cut coproduct, and…

We consider the counting problem of the number of \textit{leaf-labeled increasing trees}, where internal nodes may have an arbitrary number of descendants. The set of all such trees is a discrete representation of the genealogies obtained…

The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…

We introduce the bicategory of bialgebras with coverings (which can be thought of as coalgebra-indexed families of morphisms), and provide a motivating application to the transfer of formulas for primitives and antipode. Additionally, we…

In various subjects including mathematics, one can hope to use mathematical thinking well when the right kinds of algebraic structure to consider can be discovered or spotted. Therefore, it would help to understand kinds of algebraic…

In this paper we focus on a certain self-distributive multiplication on coalgebras, which leads to so-called rack bialgebra. Inspired by semi-group theory (adapting the Suschkewitsch theorem), we do some structure theory for rack bialgebras…

A number of hook formulas and hook summation formulas have previously appeared, involving various classes of trees. One of these classes of trees is rooted trees with labelled vertices, in which the labels increase along every chain from…