![]() |
Discrete Mathematics & Theoretical Computer Science |
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 application, we construct a new combinatorial Hopf algebra on binary trees with multiplicities and use it to prove a hook length formula for those trees.
Source : ScholeXplorer
IsRelatedTo ARXIV 1810.00148 Source : ScholeXplorer IsRelatedTo DOI 10.37236/9459 Source : ScholeXplorer IsRelatedTo DOI 10.48550/arxiv.1810.00148
|