Primitive Elements of the Hopf Algebras of Tableaux

TL;DR

This paper characterizes the primitive elements of the Poirier-Reutenauer Hopf algebra of tableaux using a partial order, extending methods previously applied to permutation Hopf algebras.

Contribution

It introduces a new method to identify primitive elements in the Hopf algebra of tableaux, building on prior work with permutation Hopf algebras.

Findings

Primitive elements of the Hopf algebra of tableaux are explicitly determined.

A partial order on tableaux is used to facilitate the identification of primitive elements.

The approach extends the algebraic understanding of tableau combinatorics.

Abstract

The character theory of symmetric groups, and the theory of symmetric functions, both make use of the combinatorics of Young tableaux, such as the Robinson-Schensted algorithm, Schuetzenberger's "jeu de taquin", and evacuation. In 1995 Poirier and the second author introduced some algebraic structures, different from the plactic monoid, which induce some products and coproducts of tableaux, with homomorphisms. Their starting point are the two dual Hopf algebras of permutations, introduced by the authors in 1995. In 2006 Aguiar and Sottile studied in more detail the Hopf algebra of permutations: among other things, they introduce a new basis, by Moebius inversion in the poset of weak order, that allows them to describe the primitive elements of the Hopf algebra of permutations. In the present note, by a similar method, we determine the primitive elements of the Poirier-Reutenauer algebra of tableaux, using a partial order on tableaux defined by Taskin.