Displaying similar documents to “Colored trees and noncommutative symmetric functions.”

Sets with two associative operations

Teimuraz Pirashvili (2003)

Open Mathematics

Similarity:

In this paper we consider duplexes, which are sets with two associative binary operations. Dimonoids in the sense of Loday are examples of duplexes. The set of all permutations carries a structure of a duplex. Our main result asserts that it is a free duplex with an explicitly described set of generators. The proof uses a construction of the free duplex with one generator by planary trees.

Canonical characters on simple graphs

Tanja Stojadinović (2013)

Czechoslovak Mathematical Journal

Similarity:

A multiplicative functional on a graded connected Hopf algebra is called the character. Every character decomposes uniquely as a product of an even character and an odd character. We apply the character theory of combinatorial Hopf algebras to the Hopf algebra of simple graphs. We derive explicit formulas for the canonical characters on simple graphs in terms of coefficients of the chromatic symmetric function of a graph and of canonical characters on quasi-symmetric functions. These...

Smash (co)products and skew pairings.

José N. Alonso Alvarez, José Manuel Fernández Vilaboa, Ramón González Rodríguez (2001)

Publicacions Matemàtiques

Similarity:

Let τ be an invertible skew pairing on (B,H) where B and H are Hopf algebras in a symmetric monoidal category C with (co)equalizers. Assume that H is quasitriangular. Then we obtain a new algebra structure such that B is a Hopf algebra in the braided category γD and there exists a Hopf algebra isomorphism w: B ∞ H → B [×] H in C, where B ∞ H is a Hopf algebra with (co)algebra structure the smash (co)product and B [×] H is the Hopf algebra defined by Doi and Takeuchi. ...