Page 1

Displaying 1 – 10 of 10

Showing per page

Canonical characters on simple graphs

Tanja Stojadinović (2013)

Czechoslovak Mathematical Journal

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 formulas and...

Categorification of Hopf algebras of rooted trees

Joachim Kock (2013)

Open Mathematics

We exhibit a monoidal structure on the category of finite sets indexed by P-trees for a finitary polynomial endofunctor P. This structure categorifies the monoid scheme (over Spec ℕ) whose semiring of functions is (a P-version of) the Connes-Kreimer bialgebra H of rooted trees (a Hopf algebra after base change to ℤ and collapsing H 0). The monoidal structure is itself given by a polynomial functor, represented by three easily described set maps; we show that these maps are the same as those occurring...

Groupes de renormalisation pour deux algèbres de Hopf en produit semi-direct

Mohamed Belhaj Mohamed (2013)

Annales de la faculté des sciences de Toulouse Mathématiques

Nous considérons deux algèbres de Hopf graduées connexes en interaction, l’une étant un comodule-cogèbre sur l’autre. Nous montrons comment définir l’analogue du groupe de renormalisation et de la fonction Bêta de Connes-Kreimer lorsque la bidérivation de graduation est remplacée par une bidérivation provenant d’un caractère infinitésimal de la deuxième algèbre de Hopf.

Shuffle bialgebras

María Ronco (2011)

Annales de l’institut Fourier

The goal of our work is to study the spaces of primitive elements of some combinatorial Hopf algebras, whose underlying vector spaces admit linear basis labelled by subsets of the set of maps between finite sets. In order to deal with these objects we introduce the notion of shuffle algebras, which are coloured algebras where composition is not always defined. We define bialgebras in this framework and compute the subpaces of primitive elements associated to them. These spaces of primitive elements...

[unknown]

Loïc Foissy, Frédéric Patras, Jean-Yves Thibon (0)

Annales de l’institut Fourier

Currently displaying 1 – 10 of 10

Page 1